Improved Examples of Non-Termination for Ruppert's Algorithm
Alexander Rand
TL;DR
This paper presents enhanced examples of planar straight-line graphs that demonstrate the non-termination of Ruppert's algorithm at a lower minimum angle threshold of 29.06 degrees.
Contribution
The authors provide improved examples that extend the known non-termination cases of Ruppert's algorithm to lower angle thresholds.
Findings
Two new planar straight-line graphs cause non-termination at 29.06 degrees
The examples improve upon previous non-termination cases
Demonstrates the limits of Ruppert's algorithm's termination conditions
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Numerical Analysis Techniques · Advanced Vision and Imaging