inter surface mapping l.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Inter-Surface Mapping PowerPoint Presentation
Download Presentation
Inter-Surface Mapping

Loading in 2 Seconds...

play fullscreen
1 / 32
chakaluka

Inter-Surface Mapping - PowerPoint PPT Presentation

113 Views
Download Presentation
Inter-Surface Mapping
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

  1. Inter-Surface Mapping John Schreiner, Arul Asirvatham, Emil Praun (University of Utah) Hugues Hoppe (Microsoft Research)

  2. Introduction • No intermediate domain • Reduced distortion • Natural alignment of features

  3. Motivating Applications • Morphing • Digital geometry processing • Transfer of surface attributes • Deformation transfer

  4. Related Work – Alexa 2000 • Composition of 2 maps • Only for genus 0 objects • Soft constraints 

  5. Related Work – Lee et al 1999 • Composition of 3 maps • Significant user input required

  6. Related Work – Praun et al 2001 • Robust mesh partitioning for genus 0 • Requires user-defined simplicial complex

  7. Related Work – Kraevoy et al 2004 • Simplicial complex inferred automatically (robust for genus 0) • Composition of 2 maps, and optimization • Needs more correspondences

  8. How Is Our Method Different? • Directly create inter-surface map • Symmetric coarse-to-fine optimization • Symmetric stretch metric  Automatic geometric feature alignment • Robust • Very little user input • Arbitrary genus • Hard constraints

  9. Map Representation • Vertices: face, barycentric coordinates within face • Edge-edge intersections: split ratios

  10. Algorithm Overview • Consistent mesh partitioning • Constrained Simplification • Trivial map between base meshes • Coarse-to-fine optimization

  11. Consistent Mesh Partitioning • Compute matching shortest paths (possibly introducing Steiner vertices) • Add paths not violating legality conditions

  12. Legality Conditions • Paths don’t intersect • Consistent neighbor ordering • Cycles don’t enclose unconnected vertices • First build maximal graph without sep cycles • genus 0: spanning tree • genus > 0: spanning tree + 2g non-sep cycles

  13. Minimal User Input • Few user-specified features • Useful for initial alignment • Not maintained during optimization 2 1 1 2 4 3 3 4

  14. Automatic Insertion Of Feature Points Add features if not enough to resolve genus

  15. Coarse-to-Fine Algorithm • Interleaved refinement • Vertex optimization

  16. Vertex Optimization

  17. Vertex Optimization ~ w M1 ~ v’ ~ u ~ v M2 w v u

  18. 2D Layout ~ w M1 ~ u ~ v M2 w v u ^ w I I R2 R2 ^ ^ u v

  19. Line Searches M2 I R2 M1

  20. Stretch Evaluation M2 I R2 M1

  21. Stretch Metric • Automatically encourages feature correspondence Conformal Stretch

  22. Results: Inter-Surface Mapping

  23. Results: Inter-Surface Mapping Low distortion around hard constraints

  24. Results: Inter-Surface Mapping Arbitrary genus (genus 2; 8 user feature points)

  25. Additional Applications Mesh M1 Application Simplicial parameterization Spherical geometry images Toroidal geometry images

  26. Results: Simplicial Parameterization M1 [Khodakovsky et al ’03] Ours

  27. Results: Octahedral Parameterization • better parametrization efficiency • more accurate remesh [Praun and Hoppe 2003] M1 M2

  28. Results: Toroidal Parameterization • Geometry image remeshing • All vertices valence 4 M1 M2

  29. Robustness

  30. Robustness

  31. Conclusion • Directly create inter-surface map • Symmetric coarse-to-fine optimization • Symmetric stretch metric  Automatic geometric feature alignment • Robust: guaranteed bijection • Arbitrary genus • Hard constraints • General tool with many applications

  32. Future Work • Faster technique • Currently: 64K faces, 2.4GHz  2 hours • More than 2 models • Surfaces with different topologies