On minimum weight pseudo-triangulations

Authors:
Oswin Aichholzer;Franz Aurenhammer;Thomas Hackl;Bettina Speckmann
Affiliations:
Institute for Software Technology, Graz University of Technology, Graz, Austria;Institute for Theoretical Computer Science, Graz University of Technology, Graz, Austria;Institute for Software Technology, Graz University of Technology, Graz, Austria;Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands
Venue:
Computational Geometry: Theory and Applications
Year:
2009

Citing 10
Cited 0

An ω(√n) lower bound for the nonoptimality of the greedy triangulation

Information Processing Letters
Quasi-greedy triangulations approximating the minimum weight triangulation

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Tight degree bounds for pseudo-triangulations of points

Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip

SIAM Journal on Computing
The Polytope of Non-Crossing Graphs on a Planar Point Set

Discrete & Computational Geometry
Minimum weight pseudo-triangulations

Computational Geometry: Theory and Applications
Triangulations without pointed spanning trees

Computational Geometry: Theory and Applications
Minimum-weight triangulation is NP-hard

Journal of the ACM (JACM)
On constrained minimum pseudotriangulations

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this note we discuss some structural properties of minimum weight pseudo-triangulations of point sets.