120 likes | 206 Views
Mesh fixup II. Rudro Samanta Princeton University. Using tolerances. Give vertices and edges “tolerance” Steps in the algorithm Vertex merging Edge merging Edge breaking. Drawbacks. Spike generation User intervention required Tolerance must be chosen carefully
E N D
Mesh fixup II Rudro Samanta Princeton University
Using tolerances • Give vertices and edges “tolerance” • Steps in the algorithm • Vertex merging • Edge merging • Edge breaking
Drawbacks • Spike generation • User intervention required • Tolerance must be chosen carefully • How to maintain features ? • Backtracking is expensive
Radiosity requirements • Continuous interpolation • Well shaped • Sufficient radiator density • Sufficient receiver node density • Intersecting faces should be represented explicitly
Processing stages • Grouper • Merges geometry • Removes T vertices • Maximizes coplanar faces
Stages continued • Lsect • Removes face intersections by breaking planes • Coplanar • Removes overlapping coplanar faces • Pmesh • Uniformly subdivides faces • Initially squares and then traiangulation • Emesh
Problems • Again a error tolerance is required • Authors say this is automatically computed (“scene relative tolerance”)
Spatial subdivision • Divide space by polygon planes • Generate solidity values • Create consistent model
Drawbacks • Missing polygons • May generate spurious features • Connected parts • Solidity determination becomes unclear
Conclusion • Approaches are usually straightforward • Need some user intervention in many pf the processes (usually for error bound) • Missing polygons still a mystery
Future work • The next level • (Fuzzy ?) Object recognition • Characteristic database and detection • Procedural correction