ABSTRACT
This paper introduces a concise and responsiveness data structure, called AIF (Adjacency and Incidence Framework), for multiresolution meshes, as well as a new simplification algorithm based on the planarity of neighboring faces. It is an optimal data structure for polygonal meshes, manifold and non-manifold, which means that a minimal number of direct and indirect accesses are required to retrieve adjacency and incidence information from it. These querying tools are necessary for dynamic multiresolution meshing algorithms (e.g. refinement and simplification operations). AIF is an orientable, but not oriented, data structure, i.e. an orientation can be topologically induced as needed in many computer graphics and geometric modelling applications. On the other hand, the simplification algorithm proposed in this paper is "memoryless" in the sense that only the current approximation counts to compute the next one; no information about the original shape or previous approximations is considered.
References
- ASPERT, N., SANTA-CRUZ, D., AND EBRAHIMI, T. 2002. Mesh: Measuring errors between surfaces using the hausdorff distance. In Proc. of the IEEE International Conference in Multimedia and Expo (ICME), vol. 1, 705-708.Google Scholar
Cross Ref
- BAUMGART, B. C. 1972. Winged-edge polyhedron representation. Tech. rep., STAN-CS-320, Stanford University. Google Scholar
Digital Library
- BRISSON, E. 1993. Representing geometric strutures in d dimension: topology and order. Discrete & Computational Geometry 9, 4, 387-426.Google Scholar
Digital Library
- CAMPAGNA, S., KOBBELT, L., AND SEIDEL, H.-P. 1998. Directed edges -- A scalable representation for triangle meshes. Journal of Graphics Tools: JGT 3, 4, 1-12. Google Scholar
Digital Library
- CAREY, R., BELL, G., AND MARRIN, C. 1997. The reality modeling language iso/iec 14772-1. Tech. rep., The VRML Consortium Incorporated.Google Scholar
- CIGNONI, P., ROCCHINI, C., AND SCOPIGNO, R. 1996. Metro: measuring error on simplified surfaces. Tech. rep., B4-01-01-96, I.E.I-C.N.R., Pisa, Italy. Google Scholar
Digital Library
- CIGNONI, P., MONTANI, C., AND SCOPIGNO, R. 1997. A comparison of mesh simplification algorithms. Computers and Graphics 22, 1, 37-54.Google Scholar
Cross Ref
- COHEN, J., VARSHNEY, A., MANOCHA, D., TURK, G., WEBER, H., AGARWAL, P., FREDERICK BROOKS, AND WRIGHT, W. 1996. Simplification envelopes. In Proc. Siggraph '96, 119-128. Google Scholar
Digital Library
- ECK, M., DEROSE, T., DUCHAMP, T., HOPPE, H., LOUNSBERY, M., AND STUETZLE, W. 1995. Multiresolution analysis of arbitrary meshes. Computer Graphics 29, Annual Conference Series, 173-182. Google Scholar
Digital Library
- GARLAND, M., AND HECKBERT, P. S. 1997. Surface simplification using quadric error metrics. In Computer Graphics, vol. 31, 209-216. Google Scholar
Digital Library
- GARLAND, M. 1999. Multiresolution modeling: Survey & future opportunities. In Eurographics '99 - State of the Art Reports, 111-131.Google Scholar
- GUÉZIEC, A. 1995. Surface simplification with variable tolerance. In Second Annual Intl. Symp. on Medical Robotics and Computer Assisted Surgery (MRCAS '95), 132-139.Google Scholar
- HECKBERT, P. S., AND GARLAND, M. 1997. Survey of polygonal surface simplification algorithms. In Siggraph'97 Course Notes 25.Google Scholar
- HOPPE, H., DEROSE, T., DUCHAMP, T., MCDONALD, J., AND STUETZLE, W. 1993. Mesh optimization. In Proc. Siggraph'93, 19-26. Google Scholar
Digital Library
- HOPPE, H. 1996. Progressive meshes. In Siggraph'96 Conference Proceedings, 99-108. Google Scholar
Digital Library
- HOPPE, H. 1998. View-dependent refinement of progressive meshes. Tech. rep., MSR-TR-98-02, Microsoft Research.Google Scholar
- HUBELI, A., AND GROSS, M. 2000. A survey of surface representations for geometric modeling. Tech. rep., #335, Swiss Federal Institute of Technology Zurich.Google Scholar
- KIM, J., AND LEE, S. 2001. Truly selective refinement of progressive meshes. In Proc. of Graphics Interface 2001, 101-110. Google Scholar
Digital Library
- KLEIN, R., LIEBICH, G., AND STRASSER, W. 1996. Mesh reduction with error control. In IEEE Visualization '96, R. Yagel and G. M. Nielson., Eds., 311-318. Google Scholar
Digital Library
- KOBBELT, L., CAMPAGNA, S., AND SEIDEL, H.-P. 1998. A general framework for mesh decimation. In Graphics Interface, 43-50.Google Scholar
- LEE, A., DOBKIN, D., SWELDENS, W., AND SCHRÖDER, P. 1999. Multiresolution mesh morphing. In Siggraph 1999, Computer Graphics Proceedings, Addison Wesley Longman, Los Angeles, A. Rockwood, Ed., 343-350. Google Scholar
Digital Library
- LINDSTROM, P., AND TURK, G. 1998. Fast and memory efficient polygonalsimplification. In IEEE Visualization '98 Conference proceedings, 297-286. Google Scholar
Digital Library
- LOOP, C. 2000. Managing adjacency in triangular meshes. Tech. rep., No. MSR-TR-2000-24, Microsoft Research.Google Scholar
- LOUNSBERY, M., DEROSE, T. D., AND WARREN, J. 1997. Multiresolution analysis for surfaces of arbitrary topological type. ACM Transactions on Graphics 16, 1, 34-73. Google Scholar
Digital Library
- MANTYLA, M. 1988. An Introduction to Solid Modeling. Computer Science Press. Google Scholar
Digital Library
- NI, X., AND BLOOR, M. S. 1994. Performance evaluation of boundary data structures. IEEE Computer Graphics and Applications 14, 6, 66-77. Google Scholar
Digital Library
- PAJAROLA, R. 2001. Fastmesh: Efficient view-dependent meshing. In Proceedings Pacific Graphics 2001, 22-30. Google Scholar
Digital Library
- POPOVIC, J., AND HOPPE, H. 1997. Progressive simplicial complexes. In Computer Graphics, vol. 31, 217-224. Google Scholar
Digital Library
- ROY, M., NICOLIER, F., FOUFOU, S., TRUCHETET, F., KOSCHAN, A., AND ABIDI, M. 2002. Assessment of mesh simplification algorithm quality. In Proceedings of SPIE Electronic Imaging, vol. 4661, 128-137.Google Scholar
- SCHROEDER, W. J., ZARGE, J. A., AND LORENSEN, W. E. 1992. Decimation of triangle meshes. In Proc. Siggraph'92, 65-70. Google Scholar
Digital Library
- TAUBIN, G., AND ROSSIGNAC, J. 1998. Geometric compression through topological surgery. ACM Transactions on Graphics 17, 2, 84-115. Google Scholar
Digital Library
- TOUMA, C., AND GOTSMAN, C. 1998. Triangle mesh compression. In Proceedings of Graphics Interface'98, Morgan Haufmann Publishers, K. B. W. Davis and A. Fournier, Eds., 26-34.Google Scholar
- TURK, G. 1992. Re-tiling polygonal surfaces. Computer Graphics 26, 2, 55-64. Google Scholar
Digital Library
- WAVEFRONT TECHNOLOGIES, I. 1998. Wavefront file formats. Tech. rep., Version 4.0 RG-10-004 (1ł ed.), Santa Barbara, California, USA.Google Scholar
- WEILER, K. 1985. Edge-based data structure for solid modelling in curved-surface environments. IEEE Computer Graphics and Applications 5, 1, 21-40.Google Scholar
Digital Library
- WEILER, K. 1998. The radial edge struture: a topological representation for non-manifold geometric boundary modelling. Geometric Modelling for CAD applications.Google Scholar
- ZELINKA, S., AND GARLAND, M. 2002. Permission grids: Pratical, error-bounded simplification. ACM Transaction on Graphics 21, 2, 207-229. Google Scholar
Digital Library
- ZORIN, D., SCHRÖDER, P., AND SWELDENS, W. 1997. Interactive multiresolution mesh editing. In SIGGRAPH 97 Conference Proceedings, 259-268. Google Scholar
Digital Library
Index Terms
Adjacency and incidence framework




Comments