Partitioning a polygonal region into trapezoids
Journal of the ACM (JACM)
A physically based approach to 2–D shape blending
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Feature-based image metamorphosis
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
On compatible triangulations of simple polygons
Computational Geometry: Theory and Applications
2-D shape blending: an intrinsic solution to the vertex path problem
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Warping and morphing of graphical objects
Warping and morphing of graphical objects
Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
As-rigid-as-possible shape interpolation
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
On Compatible Star Decompositions of Simple Polygons
IEEE Transactions on Visualization and Computer Graphics
Shape Blending Using the Star-Skeleton Representation
IEEE Computer Graphics and Applications
A Fuzzy Approach to Digital Image Warping
IEEE Computer Graphics and Applications
| Hi-index | 0.00 |
This paper describes some applications in computer graphics and computational geometry where establishing a vertex correspondence between a pair of objects is necessary. We present an algorithm for establishing a correspondence between the vertices of a pair of polygons by inserting new vertices, regardless of the polygons' locations, orientations, sizes, shapes, or numbers of vertices. The new vertices can be inserted either at the existing vertices or along the corresponding edges of the polygons. After establishing a successful correspondence between the vertices, its role in compatible convex decompositions, skeleton construction and polygon morphing is discussed.