Abstract
The three-dimensional symmetric data structure is a topological model of a three-dimensional triangulation. It is a generalization of the symmetric structure proposed by Woo [Woo85] for describing the boundary of a solid object. In the paper, we present the basic topological elements of a 3D triangulation and their mutual relations. We describe the 3D symmetric structure and present structure accessing algorithms for retrieving those relations which are not explicitly encoded in the structure. Finally, a minimal set of primitive operators for building and manipulating a 3D triangulation are discussed. Such operators are independent of the underlying data structure.
Cite
CITATION STYLE
Bruzzone, E., De Floriani, L., & Puppo, E. (1989). Manipulating three-dimensional triangulations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 367 LNCS, pp. 339–353). Springer Verlag. https://doi.org/10.1007/3-540-51295-0_141
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
