Du är här

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

Publiceringsår: 2006
Språk: Engelska
Sidor: 28-34
Publikation/Tidskrift/Serie: Computational Geometry
Volym: 34
Nummer: 1 (Special Issue on the Japan Conference on Discrete and Computational Geometry 2004)
Dokumenttyp: Artikel
Förlag: Elsevier Science B.V.

Sammanfattning

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.

Disputation

Nyckelord

  • Technology and Engineering
  • triangulation
  • dilation
  • polynomial-time approximation scheme
  • polygon

Övrigt

Published
  • VR 2005-4085
Yes
  • ISSN: 0925-7721

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen

LERU logo U21 logo