Merging polyhedral shapes with scattered features

The paper presents a technique for merging two genus 0 polyhedra. Merging establishes correspondences between vertices of the models as a first step in a 3D morphing process. The technique allows for the specification of scattered features to be aligned. This is accomplished by performing the following three steps: First, initial embeddings of the polyhedra on unit spheres are computed. Second, the embeddings are deformed such that user defined features (vertices) coincide on the spheres. Third, an overlay of the subdivisions is computed and the aligned vertices are fused in the merged model.

[1]  Wayne E. Carlson,et al.  Shape transformation for polyhedral objects , 1992, SIGGRAPH.

[2]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[3]  E. Steinitz,et al.  Vorlesungen über die Theorie der Polyeder unter Einfluss der Elemente der Topologie , 1934 .

[4]  Richard E. Parent,et al.  Shape averaging and its applications to industrial design , 1989, IEEE Computer Graphics and Applications.

[5]  Frank Harary,et al.  Graph Theory , 2016 .

[6]  Hiromasa Suzuki,et al.  3D geometric metamorphosis based on harmonic map , 1997, Proceedings The Fifth Pacific Conference on Computer Graphics and Applications.

[7]  Tony DeRose,et al.  Multiresolution analysis of arbitrary meshes , 1995, SIGGRAPH.

[8]  Jarek Rossignac,et al.  Solid-interpolating deformations: Construction and animation of PIPs , 1991, Comput. Graph..

[9]  K. Wagner.  Bemerkungen zum Vierfarbenproblem. , 1936 .

[10]  Jack Ritter,et al.  An efficient bounding sphere , 1990 .

[11]  George Wolberg,et al.  Digital image warping , 1990 .

[12]  H. S. M. Coxeter,et al.  Vorlesungen über die Theorie der Polyeder , 1935 .

[13]  D. Thalmann,et al.  A general algorithms for 3-D shape interpolation in a facet-based representation , 1989 .

[14]  Wayne E. Carlson,et al.  Establishing correspondences by topological merging: a new approach to 3-d shape transformation" pro , 1991 .

[15]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[16]  Ayellet Tal,et al.  Polyhedron realization for shape transformation , 1998, The Visual Computer.

[17]  Ari Rappoport,et al.  Shape blending using the star-skeleton representation , 1995, IEEE Computer Graphics and Applications.

[18]  Dinesh Manocha,et al.  Feature-based surface decomposition for correspondence and morphing between polyhedra , 1998, Proceedings Computer Animation '98 (Cat. No.98EX169).

[19]  Heinrich Müller,et al.  Image warping with scattered data interpolation , 1995, IEEE Computer Graphics and Applications.

[20]  Francis Lazarus,et al.  Feature-based shape transformation for polyhedral objects , 1994 .

[21]  David E. Muller,et al.  Finding the Intersection of two Convex Polyhedra , 1978, Theor. Comput. Sci..

[22]  Douglas DeCarlo,et al.  Topological Evolution of Surfaces , 1996, Graphics Interface.

[23]  George Wolberg,et al.  Image morphing: a survey , 1998, The Visual Computer.

[24]  W. T. Tutte.  How to Draw a Graph , 1963 .

[25]  Ulrich Finke,et al.  Overlaying simply connected planar subdivisions in linear time , 1995, SCG '95.

[26]  Thomas W. Sederberg,et al.  A physically based approach to 2–D shape blending , 1992, SIGGRAPH.

[27]  Anne Verroust-Blondet,et al.  Three-dimensional metamorphosis: a survey , 1998, The Visual Computer.

[28]  Emo Welzl,et al.  Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.

[29]  Marc Levoy,et al.  Feature-based volume metamorphosis , 1995, SIGGRAPH.

[30]  Nur Arad,et al.  Image Warping Using Few Anchor Points and Radial Functions , 1995, Comput. Graph. Forum.

[31]  Daniel Cohen-Or,et al.  Warp-guided object-space morphing , 1998, The Visual Computer.