DMCA
Guaranteed Intersection-Free Polygon Morphing (2001)
Cached
Download Links
- [www.cs.technion.ac.il]
- [www.cs.technion.ac.il]
- DBLP
Other Repositories/Bibliography
| Citations: | 41 - 8 self |
BibTeX
@MISC{Gotsman01guaranteedintersection-free,
author = {Craig Gotsman and Vitaly Surazhsky},
title = {Guaranteed Intersection-Free Polygon Morphing},
year = {2001}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present a method for naturally and continuously morphing two simple planar polygons with corresponding vertices in a manner that guarantees that the intermediate polygons are also simple. This contrasts with all existing polygon morphing schemes who cannot guarantee the non-self-intersection property on a global scale, due to the heuristics they employ. Our method achieves this property by reducing the polygon morphing problem to the problem of morphing compatible planar triangulations of corresponding point sets, which is performed by interpolating vertex barycentric coordinates instead of vertex locations. The reduction involves compatibly triangulating simple polygons and polygons with a single hole. We show how to achieve this using only a small number of extra (Steiner) vertices. # 2001 Elsevier Science Ltd. All rights reserved.
