Takayuki Kanaya
ABSTRACT
Product developers have used a lot of polygon data, approximated from 3D-CAD data, as a collaboration tool on the Internet. It is difficult to deal with this data for example with respect to transmission, computational cost, or rendering, so simplification algorithms are required for data compression. In general, a vertex-clustering algorithm in simplification algorithms is very fast, although it has the problem that topology information is not preserved and for some applications, such as 3D-CAD, it is important to preserve topology information. We define topology information in this paper as genus on the polyhedron and 2-manifold. In this paper, we propose a topology-preserving simplification method using a depth-first search tree on a vertex-clustering algorithm. Our method does not lose the advantage that vertex-clustering algorithms are fast yet it solves the problem of lost topology information. Experimental results show that this method is effective and is easily adapted to space division algorithms of other vertex-clustering algorithms
- Cignoni, P., Rocchini, C., and Scopigno, R. 1996. Metro: measuring error on simplified surfaces. Tech. rep., Paris, France, France. Google Scholar
Digital Library
- Garland, M., and Shaffer, E. 2002. A multiphase approach to efficient surface simplification. In VIS '02: Proceedings of the conference on Visualization '02, IEEE Computer Society, Washington, DC, USA, 117--124. Google ScholarDigital Library
- Garland, M. 1999. Quadric-based polygonal surface simplification. PhD thesis, Carnegie Mellon University. Chair-Paul Heckbert. Google ScholarDigital Library
- Gerstner, T., and Pajarola, R. 2000. Topology preserving and controlled topology simplifying multiresolution isosurface extraction. 259--266.Google Scholar
- Ju, T., Losasso, F., Schaefer, S., and Warren, J. 2002. Dual contouring of hermite data. In SIGGRAPH '02: Proceedings of the 29th annual conference on Computer graphics and interactive techniques, ACM Press, New York, NY, USA, 339--346. Google ScholarDigital Library
- Kanaya, T., and Kobori, K. 2001. Real time Simplification in polygon environment. In 9th International Conference on Human-Computer Interaction, HCI International 2001, EP & CE UAHCI, 223--224.Google Scholar
- Lindstrom, P. 2000. Out-of-core simplification of large polygonal models. In SIGGRAPH '00: Proceedings of the 27th annual conference on Computer graphics and interactive techniques, ACM Press/Addison-Wesley Publishing Co., New York, NY, USA, 259--262. Google ScholarDigital Library
- Low, K.-L., and Tan, T.-S. 1997. Model simplification using vertex-clustering. In SI3D '97: Proceedings of the 1997 symposium on Interactive 3D graphics, ACM Press, New York, NY, USA, 75--82. Google ScholarDigital Library
- Luebke, D., and Erikson, C. 1997. View-dependent simplification of arbitrary polygonal environments. In SIGGRAPH '97: Proceedings of the 24th annual conference on Computer graphics and interactive techniques, ACM Press/Addison-Wesley Publishing Co., New York, NY, USA, 199--208. Google ScholarDigital Library
- Rossignac, J., and Borrel, P. 1993. Multi-resolution 3d approximations for rendering complex scenes. In Geometric Modeling in Computer Graphics, Springer-Verlag, New York, NY, USA, 455--465.Google Scholar
- Shaffer, E., and Garland, M. 2001. Efficient adaptive simplification of massive meshes. In VIS '01: Proceedings of the conference on Visualization '01, IEEE Computer Society, Washington, DC, USA, 127--134. Google ScholarDigital Library
- Wood, Z., Hoppe, H., Desbrun, M., and Schröder, P. 2004. Removing excess topology from isosurfaces. ACM Trans. Graph. 23, 2, 190--208. Google ScholarDigital Library
- Zhang, N., Hong, W., and Kaufman, A. 2004. Dual contouring with topology-preserving simplification using enhanced cell representation. In VIS '04: Proceedings of the conference on Visualization '04, IEEE Computer Society, Washington, DC, USA, 505--512. Google ScholarDigital Library
Recommendations
Material-Discontinuity Preserving Progressive Mesh Using Vertex-Collapsing Simplification
Level Of Detail (LOD) modelling or mesh reduction has been found useful in interactive walkthrough applications. Progressive meshing techniques based on edge or triangle collapsing have been recognised useful in continuous LOD, progressive refinement, ...
Hierarchical topology-preserving simplification of terrains
We present an algorithm for simplifying terrain data that preserves topology. We use a decimation algorithm that simplifies the given data set using hierarchical clustering. Topology constraints, along with local error metrics, are used to ensure ...
Adaptive Mesh Simplification Using Vertex Clustering with Topology Preserving
CSSE '08: Proceedings of the 2008 International Conference on Computer Science and Software Engineering - Volume 02An improved adaptive mesh simplification method based on vertex clustering is presented in this paper. This algorithm can preserve the model topology and geometric features better than traditional vertex-clustering methods. Using the adjacency ...
Comments