Joint triangulations and triangulation maps
SCG '87 Proceedings of the third annual symposium on Computational geometry
On compatible triangulations of simple polygons
Computational Geometry: Theory and Applications
Triangulating with high connectivity
Computational Geometry: Theory and Applications
Controllable morphing of compatible planar triangulations
ACM Transactions on Graphics (TOG)
Towards compatible triangulations
Theoretical Computer Science - Computing and combinatorics
Hi-index | 0.00 |
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets. The problem is generalized to finding compatible triangulations for more than two point sets and we show that such triangulations can be constructed with only a linear number of Steiner points added to each point set. Moreover, the compatible triangulations constructed by these methods are regular triangulations.