A rational rotation method for robust geometric algorithms
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
Some APX-completeness results for cubic graphs
Theoretical Computer Science
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
On approximating a vertex cover for planar graphs
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Triangulations and Applications (Mathematics and Visualization)
Triangulations and Applications (Mathematics and Visualization)
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
Computational Geometry: Theory and Applications
Rotation distance is fixed-parameter tractable
Information Processing Letters
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
Graphs and Combinatorics
A better approximation ratio for the vertex cover problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one edge and adding another one, such that the resulting graph is again a triangulation. Flips are a major way of locally transforming triangular meshes. We show that, given a point set S in the Euclidean plane and two triangulations T"1 and T"2 of S, it is an APX-hard problem to minimize the number of edge flips to transform T"1 to T"2.