Applications of a new space-partitioning technique
Discrete & Computational Geometry
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Computing a subgraph of the minimum weight triangulation
Computational Geometry: Theory and Applications
On computing edges that are in all minimum-weight triangulations
Proceedings of the twelfth annual symposium on Computational geometry
Quasi-greedy triangulations approximating the minimum weight triangulation
Journal of Algorithms
Information Processing Letters
The greedy triangulation can be computed from the Delaunay triangulation in linear time
Computational Geometry: Theory and Applications
A lower bound for &bgr;-skeleton belonging to minimum weight triangulations
Computational Geometry: Theory and Applications
On ß-skeleton as a subgraph of the minimum weight triangulation
Theoretical Computer Science
A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
A quasi-polynomial time approximation scheme for minimum weight triangulation
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Minimum-weight triangulation is NP-hard
Journal of the ACM (JACM)
The minimum weight triangulation problem with few inner points
Computational Geometry: Theory and Applications
| Hi-index | 0.01 |
As a global optimization problem, planar minimum weight triangulation problem has attracted extensive research attention. In this paper, a new asymmetric graph called one-sided β-skeleton is introduced. We show that the one-sided circle-disconnected $${(\sqrt{2}\beta)}$$ -skeleton is a subgraph of a minimum weight triangulation. An algorithm for identifying subgraph of minimum weight triangulation using the one-sided $${(\sqrt{2}\beta)}$$ -skeleton is proposed and it runs in $${O(n^{4/3+\epsilon}+\min\{\kappa \log n, n^2\log n\})}$$ time, where 驴 is the number of intersected segmented between the complete graph and the greedy triangulation of the point set.