Template Based Mesh Completionvlady/completion/templ.pdfTemplate-based [Allen et al. 02; Allen et...
Transcript of Template Based Mesh Completionvlady/completion/templ.pdfTemplate-based [Allen et al. 02; Allen et...
University ofUniversity ofBritish ColumbiaBritish Columbia
Template Based Mesh Completion Vladislav Kraevoy Alla ShefferDepartment of Computer Science
University of British Columbia
University ofUniversity ofBritish ColumbiaBritish Columbia
Problem
Given mesh with holes (& multiple components) –complete holes and gaps
TopologyConnectivityGeometry
Need global information
University ofUniversity ofBritish ColumbiaBritish Columbia
Previous work - Completion
Local hole completion [Davis et al. 02; Liepa03;Sharf et al. 04; Levy 03]
No use of global infoTemplate-based [Allen et al. 02; Allen et al. 03]
Constrained cross-parameterization between input and templateNot robust
Template & input very similar Small holes
[Anguelov et al. 05] – template + skeletonHandles incomplete models in different posesNeed data for all skeleton links
University ofUniversity ofBritish ColumbiaBritish Columbia
Previous Work - Parameterization
Parameterization of surfaces with boundaries – 2D [Floater & Hormann 04]
Unclear what to do with “exterior” boundary Do not handle multiple componentsHigh distortion
Cross-parameterization [Praun et al. 01; Kraevoy & Sheffer 04; Schreiner et al. 04]
Use base meshClosed models or 1-to-1 hole correspondence
University ofUniversity ofBritish ColumbiaBritish Columbia
Completion - Our Approach
Cross-parameterization between incomplete meshesUse base meshRobust: large holes, any number of components & holes Low distortion – accurate completion
Global completion One to one mapping between completed model & template – topology preservationMaximal use of global info
Local completionSupports large (1M+) meshesSupports different genus
University ofUniversity ofBritish ColumbiaBritish Columbia
Stages
Input
Segmentation
Blending
Param
eteriza
tion +
Conne
ctivity/
topolo
gy com
pletio
n
University ofUniversity ofBritish ColumbiaBritish Columbia
Must support paths between markers on different components
Use virtual edges between boundary vertices
Segmentation
University ofUniversity ofBritish ColumbiaBritish Columbia
Closed Meshes - Segmentation
Incremental [Praun et al. 01; Krayevoy et al. 2003; Kraevoy and Sheffer 2004; Schreiener et al. 2004]Add pairs of matching paths between feature vertices
Validity checksIntersectionOrder (Orientation)Blocking
Add vertices when necessary
University ofUniversity ofBritish ColumbiaBritish Columbia
Limit paths structure – legal pathsOne virtual edge (at most) per path 3 types
InteriorCross-holeCross-gap
Segment template first Introduce legal path one by one
Construct base-mesh from template segmentation
Segmentation
University ofUniversity ofBritish ColumbiaBritish Columbia
Segmentation - Input
Generate spanning tree inside each component
Use only interior paths Connect components by spanning tree
Use cross-gap pathsAdd remaining paths
Use all 3 types of legal pathsAdd vertices when necessary
Guaranty consistency
Template segmentation
University ofUniversity ofBritish ColumbiaBritish Columbia
Segmentation - Output
Each patch is connected planar graph
Input
Segmentation
University ofUniversity ofBritish ColumbiaBritish Columbia
Initial Parameterization
Map each patch to base triangle - uniform [Tutte 63] Bijective
Triangulate gaps & holes on base
University ofUniversity ofBritish ColumbiaBritish Columbia
Parameterization + Triangulation
Iterative improvementNeed to allow migration between base trianglesUse overlapping domainsOur choice – unfold 2 adjacent triangles into quad
[Guskov et al. 00] – unfold to equilateral diamondOur – preserve triangle shape (when possible)
University ofUniversity ofBritish ColumbiaBritish Columbia
Parameterization + Triangulation
Iterate on overlapping domainsSmoothing + re-triangulation
University ofUniversity ofBritish ColumbiaBritish Columbia
Iterative improvement
University ofUniversity ofBritish ColumbiaBritish Columbia
Results - Female
Time 45sMarkers: 39Sizes: 20455/27562
Template (Poser)
University ofUniversity ofBritish ColumbiaBritish Columbia
Results – Mutual Completion
Time: 472sMarkers: 37Components: 2/2Sizes: 195660/230831
University ofUniversity ofBritish ColumbiaBritish Columbia
“Templateless” Completion
11 Components
University ofUniversity ofBritish ColumbiaBritish Columbia
Results – Local Completion
University ofUniversity ofBritish ColumbiaBritish Columbia
Template Based Completion
Robust - Handles very complex geometries Large gaps and holesLarge shape/pose differences between template & input
Including templates with only topology information
Efficient - O(nlogn)
Supports local completionDifferent genusLarge models/Models with no adequate global template
University ofUniversity ofBritish ColumbiaBritish Columbia
Issues/Future
Automatic marker placement
Template & input with different genus/connectivityCorrecting input “errors”
University ofUniversity ofBritish ColumbiaBritish Columbia
Questions?