On the Non-Termination of Ruppert's Algorithm

Details On the Non-Termination of Ruppert's Algorithm On the Non-Termination of Ruppert's Algorithm

2011-01-05

arxiv.org/abs/1101.1071v1

Computer Science

Computational Geometry

4 pages, 5 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Non-Termination of Ruppert's Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Non-Termination of Ruppert's Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Non-Termination of Ruppert's Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-397941