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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskriftPeer review

    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.
    Originalspråkengelska
    Sidor (från-till)28-34
    TidskriftComputational Geometry
    Volym34
    Nummer1
    DOI
    StatusPublished - 2006

    Bibliografisk information

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

    Ämnesklassifikation (UKÄ)

    • Datavetenskap (datalogi)

    Fingeravtryck

    Utforska forskningsämnen för ”A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation”. Tillsammans bildar de ett unikt fingeravtryck.

    Citera det här