1 / 11

Manifolds from meshes

Manifolds from meshes. Cindy Grimm and John Hughes, “ Modeling Surfaces of Arbitrary Topology using Manifolds ”, Siggraph ’95 J. Cotrina Navau and N. Pla Garcia, “ Modeling surfaces from meshes of arbitrary topology”,, Computer Aided Geometric Design, 2000 Lexing Ying and Denis Zorin,

marcel
Download Presentation

Manifolds from meshes

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Manifolds from meshes Cindy Grimm and John Hughes, “Modeling Surfaces of Arbitrary Topology using Manifolds”, Siggraph ’95 J. Cotrina Navau and N. Pla Garcia, “Modeling surfaces from meshes of arbitrary topology”,, Computer Aided Geometric Design, 2000 Lexing Ying and Denis Zorin, "A simple manifold-based construction of surfaces of arbitrary smoothness", Siggraph ’04

  2. Overview • Goal: Construct a smooth, analytical surface from an input sketch mesh Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

  3. Overview • Steps: • Build an abstract manifold using the connectivity of the mesh • Disks (charts), overlaps, transition functions • Assign geometry to each chart • Fit geometry to smooth approximation of sketch mesh (subdivision surface) • Blend to produce final surface Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

  4. Goals • A high-order surface construction • Important for geometric and numerical computation • Desirable features • C¥ or Ck smoothness • At least 3-flexibility at vertices • Closed-form smooth local parameterizations • Can handle arbitrary control meshes • Good visual quality • Easy to implement Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

  5. Smoothness • Ck smoothness • A standard goal in CAGD important for high-accuracy computation • Computing surface properties • C1 : needed for normal • C2 : needed for curvatures, reflection lines; • C3 : needed for curvature variation; Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

  6. Flexibility • Ability to represent local geometry • Property of surface construction method (dof) • Two-Flexibility: any desired curvature at any point 1-flexible 2-flexible Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

  7. Local parameterization • Explicit smooth local parameterization • For any point, there is an explicit formula f(x,y) defining the surface in a neighborhood of this point • Simplifies many tasks • Defining functions on surfaces • Integration over surfaces • Surface-surface intersections • Computing geodesics Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

  8. Spline-based approach • Construct surface patch for each face • Patches share boundaries • Find smooth local parameterization for every point • Difficult to guarantee smoothness for points on patch boundaries Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

  9. Manifold-based approach • Construct overlapping charts covering the mesh • Build local geometry approximating the mesh on each chart • Find blending function for each chart • Get the surface by blending local geometry … … Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

  10. Visual smoothness • Large overlap regions • Short blend regions look like discontinuities • Chart embed function agreement • End conditions • Parameterization • Close to affine • No skew, stretch Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

  11. Three techniques: Shared properties • Arbitrary topology, including boundary • Number of charts determined by number of elements in the sketch mesh • E.g., vertices, edges, faces • Default disk shape/size • E.g., n-sided unit polygon • Transition functions only between adjacent elements • E.g., a face and its vertices • Blend function covers chart • Embed functions • Subdivision surfaces are used to specify the desired geometry Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

More Related