Computer Science – Computational Geometry
Scientific paper
2011-03-20
Computer Science
Computational Geometry
Scientific paper
Improving the best known examples, two planar straight-line graphs which
cause the non-termination of Ruppert's algorithm for a minimum angle threshold
as low as 29.06 degrees are given.
No associations
LandOfFree
Improved Examples of Non-Termination for 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 Improved Examples of Non-Termination for Ruppert's Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Examples of Non-Termination for Ruppert's Algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-322268