feature based surface decomposition for correspondence and morphing between polyhedra l.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Feature-based Surface Decomposition for Correspondence and Morphing between Polyhedra PowerPoint Presentation
Download Presentation
Feature-based Surface Decomposition for Correspondence and Morphing between Polyhedra

Loading in 2 Seconds...

play fullscreen
1 / 22

Feature-based Surface Decomposition for Correspondence and Morphing between Polyhedra - PowerPoint PPT Presentation


  • 482 Views
  • Uploaded 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 'Feature-based Surface Decomposition for Correspondence and Morphing between Polyhedra' - 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

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
Highlights
  • Empower animators to create a visually pleasing morph
  • Simple user interface
  • General
previous work
Previous Work
  • 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

Two Input Polyhedra

User

Specify

Correspondence

Edit trajectories

Compute merged

polyhedron

Interpolate

trajectories

Morphing sequence

Overview
correspondence computation
Correspondence Computation
  • 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
Correspondence Computation

A (Igloo)

B (House)

correspondence computation8
Correspondence Computation

Patch A

Patch B

Extremal Vertices

mapping
Mapping

Patch A

Patch B

merging
Merging

Patch A

Patch B

analysis
Analysis

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

K = max{log Q,Q}

m = vertices in A

n = vertices in B

implementation
Implementation
  • Implemented in C++
  • Uses OpenGL and Tcl/Tk libraries for display and user interface.
  • Interactive user interface on SGI and PC systems
performance

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
Ongoing Efforts
  • 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
Ongoing Efforts
  • 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
Conclusion
  • Empower animators to create a visually pleasing morph
  • Simple user interface
  • Compute correspondence through surface decomposition
  • General