The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

På svenska

Author

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.

Department/s

  • Computer Science

Publishing year

2006

Language

English

Pages

28-34

Publication/Series

Computational Geometry

Volume

34

Issue

1

Document type

Journal article

Publisher

Elsevier

Topic

  • Computer Science

Keywords

  • triangulation
  • dilation
  • polynomial-time approximation scheme
  • polygon

Status

Published

Project

  • VR 2005-4085

ISBN/ISSN/Other

  • ISSN: 0925-7721