| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 415882 | Computational Geometry | 2006 | 7 Pages |
Abstract
We design a fully polynomial-time approximation scheme for the problem of finding a triangulation of a simple polygon with a constant number of sources of dilation that achieves the minimum vertex dilation.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
