Simulated annealing: theory and applications
Simulated annealing: theory and applications
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Computing the visibility graph via pseudo-triangulations
Proceedings of the eleventh annual symposium on Computational geometry
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Computational Geometry: Theory and Applications
Graph of triangulations of a convex polygon and tree of triangulations
Computational Geometry: Theory and Applications
Euclidean position in Euclidean 2-orbifolds
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
A new 2D tessellation for angle problems: The polar diagram
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
We consider whether any two triangulations of a polygon or a point set on a nonplanar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some remarkable exceptions, such as polygons on the cylinder, and on the flat torus, and certain configurations of points on the cylinder.