Abstract
Meshing is an important topic in geometric modelling and computer graphics. This paper introduces a concise and fast data structure, called AIF (Adjacency and Incidence Framework). Its conciseness results from the fact that it is an orientable, but not an oriented, data structure, i.e. an orientation can be topologically induced as necessary in many applications. It is an optimal C 49 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. In fact, it operates close to real-time even for huge meshes, what becomes it appropriate for real-time applications (e.g. multiresolution meshing refinement and simplification operations).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baumgart, B. G.: Winged-edge polyhedron representation. Technical report, STAN-CS-320, Stanford University, 1972.
Brisson, E.: Representing geometric structures in d dimension: topology and order. Descrete & Computational Geometry, Vol. 9,No. 4, 1993, pp.387–426.
Campagna, S., Kobblet, L., and Seidel, Hans-Peter: Directed Edges-A Scalable Representation for Triangular Meshes. JGT, Vol. 3.no.4, 1998, pp.1–12.
Carey, R., Bell, G., and Marrin, C.: The Virtual Reality Modeling Language ISO/IEC 14772-1, 1997. http://www.vrml.org/technicalinfo/specifications/
Garland, M.: Multiresolution modeling: Survey & future opportunities. In Eurographics-State of the Art Reports, 1999, pp.111–131.
Heckbert, P. S., and Garland, M.: Survey of Polygonal Surface Simplification Algorithms. Siggraph Course Notes 25, 1997.
Hoppe, H.: Progressive Meshes. Proceedings of Siggraph, 1996, pp.99–108.
Hoppe, H.: Efficient Implementation of Progressive Meshes. Computer & Graphics, Vol.22,No. 1, 1998, pp.27–36.
Kallmann, M. and Thalmann, D.: Star-Vertices: A Compact Representation for Planar Meshes with Adjacency Information. JGT, Vol.6,No. 1, 2001.
Lee, A., Dobkin, D., Sweldens, W. and Schrder, P.: Multiresolution Mesh Morphing. Proceedings of Siggraph, 1999, pp. 343–350.
Loop, C.: Managing Adjacency in Triangular Meshes. Tech. Report No. MSR-TR-2000-24, Microsoft Research, 2000.
Mäntylä, M.: An Introduction to Solid Modeling, Computer Science Press, 1988.
Ni, X., and Bloor, M. S.: Performance Evaluation of Boundary Data Structures. IEEE CG&A, Vol. 14,No. 6, 1994, pp.66–77.
Pajarola, R.: FastMesh: Efficient View-dependent Meshing. Proceedings of Pacific Graphics, 2001, pp.22–30.
Popovic, J., Hoppe, H.: Progressive Simplicial Complexes. Computer Graphics, Vol.31, 1997, pp.217–224.
Taubin, G., and Rossignac, J.: Geometric compression through topological surgery. ACM Transactions on Graphics, Vol.17,No. 2, 1998, pp.84–115.
Wavefront Technologies, Inc. Wavefront File Formats, Version 4.0 RG-10-004, first ed. Santa Barbara. CA. 1993.
Weiler, K.: The radial edge structure: a topological representation for non-manifold geometric boundary modelling. In Geometric modelling for CAD applications. Elsevier Science Publish. 1998.
Weiler, K.: Edge-Based data structure for solid geometric in Curved-Surface Environments. IEEE CG&A, Vol.5,No. 1, 1985, pp.21–40.
Zorin, D., Schrder, P., and Sweldens, W.: Interactive Multiresolution Mesh Editing. Proceedings of Siggraph, 1997, pp.259–268.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Silva, F.G.M., Gomes, A.J.P. (2003). AIF - A Data Structure for Polygonal Meshes. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44842-X_49
Download citation
DOI: https://doi.org/10.1007/3-540-44842-X_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40156-8
Online ISBN: 978-3-540-44842-6
eBook Packages: Springer Book Archive