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

    Research output: Contribution to journalArticlepeer-review

    3 Citations (SciVal)

    Abstract

    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.
    Original languageEnglish
    Pages (from-to)28-34
    JournalComputational Geometry
    Volume34
    Issue number1
    DOIs
    Publication statusPublished - 2006

    Bibliographical note

    Special Issue on the Japan Conference on Discrete and Computational Geometry 2004

    Subject classification (UKÄ)

    • Computer Science

    Keywords

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

    Fingerprint

    Dive into the research topics of 'A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation'. Together they form a unique fingerprint.

    Cite this