This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Topology Simplification for Polygonal Virtual Environments
April-June 1998 (vol. 4 no. 2)
pp. 133-144

Abstract—We present a topology simplifying approach that can be used for genus reductions, removal of protuberances, and repair of cracks in polygonal models in a unified framework. Our work is complementary to the existing work on geometry simplification of polygonal datasets and we demonstrate that using topology and geometry simplifications together yields superior multiresolution hierarchies than is possible by using either of them alone. Our approach can also address the important issue of repair of cracks in polygonal models, as well as for rapid identification and removal of protuberances based on internal accessibility in polygonal models. Our approach is based on identifying holes and cracks by extending the concept of α-shapes to polygonal meshes under the L distance metric. We then generate valid triangulations to fill them using the intuitive notion of sweeping an L cube over the identified regions.

[1] J. Cohen, A. Varshney, D. Manocha, G. Turk, H. Weber, P. Agarwal, F.P. Brooks Jr., and W.V. Wright, "Simplification Envelopes," Computer Graphics Proc. Ann. Conf. Series (Proc. Siggraph '96), pp. 119-128, 1996.
[2] T.D. DeRose, M. Lounsbery, and J. Warren, "Multiresolution Analysis for Surface of Arbitrary Topological Type," Report 93-10-05, Dept. of Computer Science, Univ. of Washington, Seattle, 1993.
[3] A. Guéziec, "Surface Simplification with Variable Tolerance," Proc. Second Int'l Symp. Medical Robotics and Computer Assisted Surgery, MRCAS '95, 1995.
[4] B. Hamann, "A Data Reduction Scheme for Triangulated Surfaces," Computer Aided Geometric Design, vol. 11, no. 2, pp. 197-214 1994.
[5] H. Hoppe, “Progressive Meshes,” Proc. SIGGRAPH '96, pp. 99-108, 1996.
[6] H. Hoppe, “View-Dependent Refinement of Progressive Meshes,” Proc. SIGGRAPH '97, pp. 189-198, 1997.
[7] J. Rossignac and P. Borel, "Multi-Resolution 3D Approximations for Rendering," Modeling in Computer Graphics, pp. 455-465. Springer-Verlag, June-July 1993.
[8] W.J. Schroeder, J.A. Zarge, and W.E. Lorensen, “Decimation of Triangle Meshes,” Proc. SIGGRAPH '92, pp. 65-70, 1992.
[9] G. Turk, "Retiling Polygonal Surfaces," Computer Graphics(Proc. Siggraph 92), vol. 26, no. 2, 1992, pp. 55-64.
[10] J.C. Xia, J. El-Sana, and A. Varshney, “Adaptive Real-Time Level-of-Detail-Based Rendering for Polygonal Models,” IEEE Trans. Visualization and Computer Graphics, 3, no. 2, pp. 171-183, Apr.-June 1997.
[11] J. El-Sana and A. Varshney, "Controlled Simplification of Genus for Polygonal Models," Proc. IEEE Visualization 97, IEEE CS Press, Los Alamitos, Calif., 1997, pp. 403-412.
[12] T. He, L. Hong, A. Varshney, and S. Wang, "Controlled Topology Simplification," IEEE Trans. Visualization and Computer Graphics, vol. 2, no. 2, pp. 171-184, June 1996.
[13] W. Schroeder, “A Topology Modifying Progressive Decimation Algorithm,” IEEE Visualization, pp. 205-212, 1997.
[14] M. Garland and P.S. Heckbert, "Surface Simplification Using Quadric Error Metrics," Proc. Siggraph 97, ACM Press, New York, 1997, pp. 209-216.
[15] J. Popovic and H. Hoppe, “Progressive Simplicial Complexes,” Proc. SIGGRAPH '97, pp. 217-224, 1997.
[16] D. Luebke and C. Erikson, “View-Dependent Simplification of Arbitrary Polygonal Environments,” Proc. SIGGRAPH '97, pp. 199-208, 1997.
[17] H. Edelsbrunner, D.G. Kirkpatrick, and R. Seidel, "On the Shape of a Set of Points in the Plane," IEEE Trans. Information Theory, vol. 29, no. 4, pp. 551-559, July 1983.
[18] H. Edelsbrunner, “Weighted Alpha Shapes,” Technical Report UIUCDCS-R-92-1,760, Computer Science Dept., Univ. Illinois, Urbana, IL, 1992.
[19] H. Edelsbrunner and D.P. Mücke, “Three-Dimensional Alpha Shapes,” ACM Trans, Graphics, vol. 13, pp. 43-72, 1994.
[20] F. Bernardini and C. Bajaj, "Sampling and Reconstructing Manifolds Using Alpha-Shapes," Technical Report CSD-97-013, Dept. of Computer Sciences, Purdue Univ., 1997.
[21] G. Barequet and S. Kumar, "Repairing CAD Models," Proc. IEEE Visualization, pp. 363-370,Phoenix, Ariz., 1997.
[22] T. Murali and T. Funkhouser, "Consistent Solid and Boundary Representations from Arbitrary Polygonal Data," Proc. Symp. Interactive 3D Graphics, pp. 155-162,Providence, R.I., 1997.
[23] G. Turk and M. Levoy, “Zippered Polygon Meshes from Range Images,” Proc. SIGGRAPH '94, pp. 311-318, 1994.
[24] J.H. Bøhn and M.J. Wozny, "A Topology-Based Approach for Shell-Closure," Geometric Modeling for Product Realization, P.R. Wilson et al., eds., pp. 297-319. North-Holland, 1993.
[25] D.R. Baum, S. Mann, K.P. Smith, and J.M. Winget, "Making Radiosity Usable: Automatic Preprocessing and Meshing Techniques for the Generation of Accurate Radiosity Solutions," Computer Graphics (Proc. Siggraph '91), vol. 25, no. 4, pp. 51-50, 1991.
[26] C. Bajaj and M.-S. Kim, "Generation of Configuration Space Obstacles: The Case of a Moving Sphere," IEEE J. Robotics and Automation, vol. 4, no. 1, pp. 94-99, Feb. 1988.
[27] R. Seiden, "A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons," Computer Geometry Theory Applications, vol. 1, pp. 51-64, 1991.
[28] K. Clarkson, R.E. Tarjan, and C.J. Van Wyk, "A Fast Las Vegas Algorithm for Triangulating a Simple Polygon," Discrete Computer Geometry, vol. 4, pp. 423-432, 1989.
[29] A. Narkhede and D. Manocha, "Fast Polygon Triangulation Based on Seidel's Algorithm," Graphics Gems, vol. 5, pp. 394-397, 1995.
[30] B. Chazelle, "An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra," SIAM J. Computing, vol. 21, no. 4, pp. 671-696, 1992.
[31] D.E. Muller and F.P. Preparata, "Finding the Intersection of Two Convex Polyhedra," Theoretical Computer Science, vol. 7, pp. 217-236, 1978.
[32] H. Fuchs, Z.M. Kedem, and S.P. Uselton, "Optimal Surface Reconstruction from Planner Contours," Comm. ACM, Vol. 20, No. 10, 1977, pp. 693-702.
[33] H. Edelsbrunner and E.P. Mücke, "Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms," Proc. Fourth Ann. ACM Symp. Computer Geometry, pp. 118-133, 1988.
[34] I. Emiris and J. Canny, "An Efficient Approach to Removing Geometric Degeneracies," Proc. Eighth Ann. Symp. Computational Geometry, pp. 74-82,Berlin, June 1992.
[35] G. Miller, “Efficient Algorithms for Local and Global Accessibility Shading,” Proc. SIGGRAPH '94, Computer Graphics Proc., Ann. Conf. Series, A. Glassner, ed., pp. 319-326, July 1994.

Index Terms:
CR Categories and Subject Descriptors: I.3.3 [Computer Graphics]: Picture/Image Generation — Display algorithms; I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling — Curve, surface, solid, and object representations, hierarchical approximation, model simplification, levels-of-detail generation, shape approximation, geometric modeling, topology simplification, CAD model repair.
Citation:
Jihad El-Sana, Amitabh Varshney, "Topology Simplification for Polygonal Virtual Environments," IEEE Transactions on Visualization and Computer Graphics, vol. 4, no. 2, pp. 133-144, April-June 1998, doi:10.1109/2945.694955
Usage of this product signifies your acceptance of the Terms of Use.