Abstract
A three-dimensional tesselation can be described by four basic topological elements (vertices, edges, faces, and polyhedral cells) plus their mutual pairwise relations. We present a specific data structure for encoding a three-dimensional tesselation composed of a collection of quasi-disjoint tetrahedra, i.e., a three-dimensional triangulation, and discuss those structure accessing algorithms which retrieve the relations not explicitly stored in the structure. A set of primitive operators for building and manipulating a 3D triangulation are presented. Their use is demonstrated in connection with an algorithm for computing a 3D Delaunay triangulation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, A.F., Hopcroft, J.E., Ullman, J.D. (1983)Data Structures and Algorithms. Addison Wesley Publ.,Reading, Ma.
Avis, D., Bhattacharya, B.K. (1983) Algorithms for Computing d-Dimensional Voronoi Diagrams and Their Duals.Advances in Computing Research, 1, Preparata, ed., JAI Press, Greenwich, CT.
Ansaldi, S., De Floriani, L., Falcidieno, B. (1985) Geometric Modeling of Solid Object by Using a Face Adjacency Graph Representation.Computer Graphics19: 131–139.
Baumgardt, M.G. (1972) Winged-Edge Polyhedron Representation.Tech. Rep. CS-320, Stanford University.
Boissonnat, J.D. (1984) Geometric Structures for Three-Dimensional Stage Representation.ACM Trans. on Graphics3: 266–286.
Boissonnat, J.D., Faugeras, O.D., Le Bras-Mehlman, E. (1988) Representing Stereo Data with Delaunay Triangulation.Proceeding IEEE Robotics and Automation, Philadelphia, April 1988.
Bowyer, A. (1981) Computing Dirichlet Tesselations.The Computer Journal27: 165–171.
Bruzzone, E., De Floriani, L., Puppo, E. (1989) Manipulating Three-Dimensional Triangulations.Proceedings FODO, Paris, June 1989.
De Floriani, L. (1987) Surface Representations Based on Triangular Grids.The Visual Computer, 3: 27–50.
Dobkin, D.P., Laszlo, M.J. (1989) Primitives for the Manipulation of Three-Dimensional Subdivisions.Algorithmica4: 3–32.
Edelsbrunner, H. (1987)Algorithms in Combinatorial Geometry. Springer-Verlag.
Guibas, L., Stolfi, J. (1985) Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams.ACM Trans. Graphics, 4: 75–123.
Greenberg, M.J. (1967)Lectures on Algebraic Topology. W.A. Benjamin, Inc., New York.
Mantyla, M. (1988)An Introduction to Solid Modeling. Computer Science Press.
Preparata, F.P., Shamos, M.I. (1985)Computational Geometry: an Introduction. Springer-Verlag.
Watson, D.F. (1981) Computing the n-dimensional Delaunay Tesselation with Applications to Voronoi Polytopes.The Computer Journal24: 167–171.
Weiler, K. (1985) Edge-based Data Structures for Solid Modeling in Curved-surface Environments.IEEE Computer Graphics and Applications5: 21–40.
Weiler, K. (1986) Topological Structures for Geometric Modeling.Ph.D. Thesis, Rensselaer Polytecnic Institute, Troy (NY).
Woo, T.C. (1985) A Combinatorial Analysis of Boundary Data Structure Schemata.IEEE Computer Graphics and Applications5: 19–27.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Tokyo
About this paper
Cite this paper
Bruzzone, E., De Floriani, L. (1990). An Efficient Data Structure for Three-Dimensional Triangulations. In: Chua, TS., Kunii, T.L. (eds) CG International ’90. Springer, Tokyo. https://doi.org/10.1007/978-4-431-68123-6_25
Download citation
DOI: https://doi.org/10.1007/978-4-431-68123-6_25
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-68125-0
Online ISBN: 978-4-431-68123-6
eBook Packages: Springer Book Archive