10.1145/604471.604503acmconferencesArticle/Chapter ViewAbstractPublication PagesgraphiteConference Proceedings
ARTICLE
Free Access

Adjacency and incidence framework: a data structure for efficient and fast management of multiresolution meshes

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

  1. 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 ScholarGoogle ScholarCross RefCross Ref
  2. BAUMGART, B. C. 1972. Winged-edge polyhedron representation. Tech. rep., STAN-CS-320, Stanford University. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. BRISSON, E. 1993. Representing geometric strutures in d dimension: topology and order. Discrete & Computational Geometry 9, 4, 387-426.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. CAREY, R., BELL, G., AND MARRIN, C. 1997. The reality modeling language iso/iec 14772-1. Tech. rep., The VRML Consortium Incorporated.Google ScholarGoogle Scholar
  6. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  7. CIGNONI, P., MONTANI, C., AND SCOPIGNO, R. 1997. A comparison of mesh simplification algorithms. Computers and Graphics 22, 1, 37-54.Google ScholarGoogle ScholarCross RefCross Ref
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. GARLAND, M., AND HECKBERT, P. S. 1997. Surface simplification using quadric error metrics. In Computer Graphics, vol. 31, 209-216. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. GARLAND, M. 1999. Multiresolution modeling: Survey & future opportunities. In Eurographics '99 - State of the Art Reports, 111-131.Google ScholarGoogle Scholar
  12. 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 ScholarGoogle Scholar
  13. HECKBERT, P. S., AND GARLAND, M. 1997. Survey of polygonal surface simplification algorithms. In Siggraph'97 Course Notes 25.Google ScholarGoogle Scholar
  14. HOPPE, H., DEROSE, T., DUCHAMP, T., MCDONALD, J., AND STUETZLE, W. 1993. Mesh optimization. In Proc. Siggraph'93, 19-26. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. HOPPE, H. 1996. Progressive meshes. In Siggraph'96 Conference Proceedings, 99-108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. HOPPE, H. 1998. View-dependent refinement of progressive meshes. Tech. rep., MSR-TR-98-02, Microsoft Research.Google ScholarGoogle Scholar
  17. HUBELI, A., AND GROSS, M. 2000. A survey of surface representations for geometric modeling. Tech. rep., #335, Swiss Federal Institute of Technology Zurich.Google ScholarGoogle Scholar
  18. KIM, J., AND LEE, S. 2001. Truly selective refinement of progressive meshes. In Proc. of Graphics Interface 2001, 101-110. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  20. KOBBELT, L., CAMPAGNA, S., AND SEIDEL, H.-P. 1998. A general framework for mesh decimation. In Graphics Interface, 43-50.Google ScholarGoogle Scholar
  21. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  22. LINDSTROM, P., AND TURK, G. 1998. Fast and memory efficient polygonalsimplification. In IEEE Visualization '98 Conference proceedings, 297-286. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. LOOP, C. 2000. Managing adjacency in triangular meshes. Tech. rep., No. MSR-TR-2000-24, Microsoft Research.Google ScholarGoogle Scholar
  24. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  25. MANTYLA, M. 1988. An Introduction to Solid Modeling. Computer Science Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. NI, X., AND BLOOR, M. S. 1994. Performance evaluation of boundary data structures. IEEE Computer Graphics and Applications 14, 6, 66-77. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. PAJAROLA, R. 2001. Fastmesh: Efficient view-dependent meshing. In Proceedings Pacific Graphics 2001, 22-30. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. POPOVIC, J., AND HOPPE, H. 1997. Progressive simplicial complexes. In Computer Graphics, vol. 31, 217-224. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. 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 ScholarGoogle Scholar
  30. SCHROEDER, W. J., ZARGE, J. A., AND LORENSEN, W. E. 1992. Decimation of triangle meshes. In Proc. Siggraph'92, 65-70. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. TAUBIN, G., AND ROSSIGNAC, J. 1998. Geometric compression through topological surgery. ACM Transactions on Graphics 17, 2, 84-115. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. 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 ScholarGoogle Scholar
  33. TURK, G. 1992. Re-tiling polygonal surfaces. Computer Graphics 26, 2, 55-64. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. WAVEFRONT TECHNOLOGIES, I. 1998. Wavefront file formats. Tech. rep., Version 4.0 RG-10-004 (1ł ed.), Santa Barbara, California, USA.Google ScholarGoogle Scholar
  35. WEILER, K. 1985. Edge-based data structure for solid modelling in curved-surface environments. IEEE Computer Graphics and Applications 5, 1, 21-40.Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. WEILER, K. 1998. The radial edge struture: a topological representation for non-manifold geometric boundary modelling. Geometric Modelling for CAD applications.Google ScholarGoogle Scholar
  37. ZELINKA, S., AND GARLAND, M. 2002. Permission grids: Pratical, error-bounded simplification. ACM Transaction on Graphics 21, 2, 207-229. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. ZORIN, D., SCHRÖDER, P., AND SWELDENS, W. 1997. Interactive multiresolution mesh editing. In SIGGRAPH 97 Conference Proceedings, 259-268. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Adjacency and incidence framework

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!

        To help support our community working remotely during COVID-19, we are making all work published by ACM in our Digital Library freely accessible through June 30, 2020. Learn more