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åk | engelska |
---|---|
Sidor (från-till) | 28-34 |
Tidskrift | Computational Geometry |
Volym | 34 |
Nummer | 1 |
DOI | |
Status | Published - 2006 |
Bibliografisk information
Special Issue on the Japan Conference on Discrete and Computational Geometry 2004Ämnesklassifikation (UKÄ)
- Datavetenskap (datalogi)