Guaranteed intersection-free polygon morphing

Citation
C. Gotsman et V. Surazhsky, Guaranteed intersection-free polygon morphing, COMPUT GRAP, 25(1), 2001, pp. 67-75
Citations number
21
Categorie Soggetti
Computer Science & Engineering
Journal title
COMPUTERS & GRAPHICS-UK
ISSN journal
00978493 → ACNP
Volume
25
Issue
1
Year of publication
2001
Pages
67 - 75
Database
ISI
SICI code
0097-8493(200102)25:1<67:GIPM>2.0.ZU;2-Z
Abstract
We present a method for naturally and continuously morphing two simple plan ar polygons with corresponding vertices in a manner that guarantees that th e intermediate polygons are also simple. This contrasts with all existing p olygon morphing schemes who cannot guarantee the non-self-intersection prop erty on a global scale, due to the heuristics they employ. Our method achie ves this property by reducing the polygon morphing problem to the problem o f morphing compatible planar triangulations of corresponding point sets, wh ich is performed by interpolating vertex barycentric coordinates instead of vertex locations. The reduction involves compatibly triangulating simple p olygons and polygons with a single hole. We show how to achieve this using only a small number of extra (Steiner) vertices. (C) 2001 Elsevier Science Ltd. All rights reserved.