Improved Examples of Non-Termination for Ruppert's Algorithm
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.