Feature based surface decomposition for correspondence and morphing between polyhedra
Download
1 / 22

- PowerPoint PPT Presentation


  • 450 Views
  • Updated On :

Feature-based Surface Decomposition for Correspondence and Morphing between Polyhedra Arthur D Gregory Andrei State, Ming C Lin, Dinesh Manocha, Mark A Livingston University of North Carolina at Chapel Hill http://www.cs.unc.edu/~geom/3Dmorphing {gregory,andrei,lin,dm,livingst}@cs.unc.edu

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about '' - Gabriel


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Feature based surface decomposition for correspondence and morphing between polyhedra l.jpg

Feature-based Surface Decomposition for Correspondence and Morphing between Polyhedra

Arthur D Gregory

Andrei State, Ming C Lin, Dinesh Manocha, Mark A Livingston

University of North Carolina at Chapel Hill

http://www.cs.unc.edu/~geom/3Dmorphing

{gregory,andrei,lin,dm,livingst}@cs.unc.edu


Highlights l.jpg
Highlights Morphing between Polyhedra

  • Empower animators to create a visually pleasing morph

  • Simple user interface

  • General


Previous work l.jpg
Previous Work Morphing between Polyhedra

  • Kanai et al. [1997]

  • DeCarlo and Gallier [1996]

  • Galin and Akkouche [1996]

  • Lazarus and Verroust [1994]

  • Kent, Carlson, and Parent [1992]

  • Kaul and Rossignac [1991]

  • Wyvill [1990]


Overview l.jpg

Two Input Polyhedra Morphing between Polyhedra

User

Specify

Correspondence

Edit trajectories

Compute merged

polyhedron

Interpolate

trajectories

Morphing sequence

Overview


Correspondence specification l.jpg
Correspondence Specification Morphing between Polyhedra


Correspondence computation l.jpg
Correspondence Computation Morphing between Polyhedra

  • Feature-Nets decompose input polyhedra into morphing patches

  • For each corresponding Morphing Patch pair:

    • map both onto a 2D polygon

    • merge the vertex-edge graphs

    • reconstruct the facets


Correspondence computation7 l.jpg
Correspondence Computation Morphing between Polyhedra

A (Igloo)

B (House)


Correspondence computation8 l.jpg
Correspondence Computation Morphing between Polyhedra

Patch A

Patch B

Extremal Vertices


Mapping l.jpg
Mapping Morphing between Polyhedra

Patch A

Patch B


Mapping desiderata l.jpg
Mapping Desiderata Morphing between Polyhedra


Merging l.jpg
Merging Morphing between Polyhedra

Patch A

Patch B


Reconstruction l.jpg
Reconstruction Morphing between Polyhedra


Completed correspondence l.jpg
Completed Correspondence Morphing between Polyhedra


Morphing trajectory specification l.jpg
Morphing Trajectory Specification Morphing between Polyhedra


Analysis l.jpg
Analysis Morphing between Polyhedra

Computation time = O(K*[m+n])

K = max{log Q,Q}

m = vertices in A

n = vertices in B


Implementation l.jpg
Implementation Morphing between Polyhedra

  • Implemented in C++

  • Uses OpenGL and Tcl/Tk libraries for display and user interface.

  • Interactive user interface on SGI and PC systems


Performance l.jpg

Models Igloo-House Triceratops-Human Human Heads Donut-Cup

Triangles 82 40 5,660 17,528 3,426 4,020 4,096 8,452

Output

Triangles

214 97,900 32,520 61,701

Morphing

Patches

10 86 67 50

User

Time

~5min ~6 hours ~3 hours ~4 hours

Time to

Compute

Merged

Polyhedron

<1sec 2.5min 30 sec 1 min

Performance


Ongoing efforts l.jpg
Ongoing Efforts Donut-Cup

  • Remove restriction that the chains of the feature net must lie on edges of the models

  • Do not require the user to specify a connected feature net

  • Provide better control of the model’s shape during the morph


Ongoing efforts19 l.jpg
Ongoing Efforts Donut-Cup

  • Remove restriction that models must be homeomorphic

    • models can change topology during the morph

  • Extend to include textured objects

    • currently interpolate only normals and vertex color



Conclusion l.jpg
Conclusion Donut-Cup

  • Empower animators to create a visually pleasing morph

  • Simple user interface

  • Compute correspondence through surface decomposition

  • General


ad