Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Non-Termination of Ruppert's Algorithm

Published 5 Jan 2011 in cs.CG | (1101.1071v1)

Abstract: A planar straight-line graph which causes the non-termination Ruppert's algorithm for a minimum angle threshold larger than about 29.5 degrees is given. The minimum input angle of this example is about 74.5 degrees meaning that failure is not due to small input angles. Additionally, a similar non-acute input is given for which Chew's second algorithm does not terminate for a minimum angle threshold larger than about 30.7 degrees.

Authors (1)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.