A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
Författare
Summary, in English
We design a fully polynomial-time approximation scheme for the problem of finding a triangulation of a simple poly-on with a constant number of sources of dilation that achieves the minimum vertex dilation. (c) 2005 Elsevier B.V. All rights reserved.
Avdelning/ar
- Computer Science
Publiceringsår
2006
Språk
Engelska
Sidor
28-34
Publikation/Tidskrift/Serie
Computational Geometry
Volym
34
Issue
1
Dokumenttyp
Artikel i tidskrift
Förlag
Elsevier
Ämne
- Computer Science
Nyckelord
- triangulation
- dilation
- polynomial-time approximation scheme
- polygon
Status
Published
Projekt
- VR 2005-4085
ISBN/ISSN/Övrigt
- ISSN: 0925-7721