On compatible triangulations of simple polygons

Citations of this article
Mendeley users who have this article in their library.


It is well known that, given two simple n-sided polygons, it may not be possible to triangulate the two polygons in a compatible fashion, if one's choice of triangulation vertices is restricted to polygon corners. Is it always possible to produce compatible triangulations if additional vertices inside the polygon are allowed? We give a positive answer and construct a pair of such triangulations with O(n2) new triangulation vertices. Moreover, we show that there exists a 'universal' way of triangulating an n-sided polygon with O(n2) extra triangulation vertices. Finally, we also show that creating compatible triangulations requires a quadratic number of extra vertices in the worst case. © 1993.




Aronov, B., Seidel, R., & Souvaine, D. (1993). On compatible triangulations of simple polygons. Computational Geometry: Theory and Applications, 3(1), 27–35. https://doi.org/10.1016/0925-7721(93)90028-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free