Recursive regularity and the finest regular coarsening
Presented by Mr. Rafel JAUME
Type: Oral presentation
Track: Discrete and Computational Geometry
We introduce the notion of recursive regularity. A polyhedral subdivision of a point set is said to be recursively regular if it can be coarsened by a regular subdivision that divides the original one into regular parts. The class of such subdivisions is a subset of the visibility-acyclic subdivisions and a superset of the regular subdivisions of a point set. However, the associated graph of flips is not necessarily connected. We relate recursively-regular subdivisions to the concept of finest regular coarsening and give a simple algorithmic characterization of the class.