A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation

Authors:
Rolf Klein;Christos Levcopoulos;Andrzej Lingas
Affiliations:
Universität Bonn, Institut für Informatik I, D-53117 Bonn, Germany;Department of Computer Science, Lund University, 22100 Lund, Sweden;Department of Computer Science, Lund University, 22100 Lund, Sweden
Venue:
Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004
Year:
2006

Citing 8
Cited 0

Delaunay graphs are almost as good as complete graphs

Discrete & Computational Geometry
Triangulating a simple polygon in linear time

Discrete & Computational Geometry
Classes of graphs which approximate the complete Euclidean graph

Discrete & Computational Geometry
Computing minimum length paths of a given homotopy class

Computational Geometry: Theory and Applications
An Optimal Algorithm for Euclidean Shortest Paths in the Plane

SIAM Journal on Computing
Approximating the Stretch Factor of Euclidean Graphs

SIAM Journal on Computing
Constructing Plane Spanners of Bounded Degree and Low Weight

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A fast algorithm for approximating the detour of a polygonal chain

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We design a fully polynomial-time approximation scheme for the problem of finding a triangulation of a simple polygon with a constant number of sources of dilation that achieves the minimum vertex dilation.