Automatically repairing invalid polygons with a constrained triangulation
Hugo Ledoux, Ken Arroyo Ohori, Martijn Meijers · Research Repository (Delft University of Technology) · 2012
Although the validation of single polygons has received considerable attention, the automatic repair of invalid polygons has not. Automated repair methods can be considered as interpreting ambiguous or ill-defined polygons and giving a coherent and clearly defined output. At this moment, automatic tools are not satisfactory and repairing is thus mostly a semi-automatic task. We present in this paper a novel method, based on a constrained triangulation, to automatically repair invalid polygons. We describe our method, highlight some implementation details and describe an experiment with highly degenerate input for which predictable output is obtained. We believe our approach is superior to other tools since it is simple, intuitive and scales to big polygons.