1 / 12

Mesh Fixup II by Rudro Samanta (Princeton University): Using Tolerances for Efficient Mesh Editing

Explore the algorithm and steps involved in mesh fixup, including vertex and edge manipulation using specific tolerances. Learn about vertex and edge merging, edge breaking, and drawbacks like spike generation. Discover the importance of user intervention and careful tolerance selection to maintain features. Understand the challenges of backtracking and radiosity requirements for continuous interpolation. Dive into processing stages such as Grouper, Lsect, Pmesh, and Emesh, with emphasis on spatial subdivision and solidity values. Uncover common problems like missing polygons and future work in object recognition and procedural correction.

nieve
Download Presentation

Mesh Fixup II by Rudro Samanta (Princeton University): Using Tolerances for Efficient Mesh Editing

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. Mesh fixup II Rudro Samanta Princeton University

  2. Using tolerances • Give vertices and edges “tolerance” • Steps in the algorithm • Vertex merging • Edge merging • Edge breaking

  3. Drawbacks • Spike generation • User intervention required • Tolerance must be chosen carefully • How to maintain features ? • Backtracking is expensive

  4. Radiosity requirements • Continuous interpolation • Well shaped • Sufficient radiator density • Sufficient receiver node density • Intersecting faces should be represented explicitly

  5. Processing stages • Grouper • Merges geometry • Removes T vertices • Maximizes coplanar faces

  6. Stages continued • Lsect • Removes face intersections by breaking planes • Coplanar • Removes overlapping coplanar faces • Pmesh • Uniformly subdivides faces • Initially squares and then traiangulation • Emesh

  7. Problems • Again a error tolerance is required • Authors say this is automatically computed (“scene relative tolerance”)

  8. Spatial subdivision • Divide space by polygon planes • Generate solidity values • Create consistent model

  9. Example fixup

  10. Drawbacks • Missing polygons • May generate spurious features • Connected parts • Solidity determination becomes unclear

  11. Conclusion • Approaches are usually straightforward • Need some user intervention in many pf the processes (usually for error bound) • Missing polygons still a mystery

  12. Future work • The next level • (Fuzzy ?) Object recognition • Characteristic database and detection • Procedural correction

More Related