Designing a Data Structure for Polyhedral Surfaces. Lutz Kettner. In: Proc. of the 14th ACM Symp. on Computational Geometry, Minneapolis, Minnesota, pp. 146-154, June 1998.
Design solutions for a program library are presented for combinatorial data structures in computational geometry, such as planar maps and polyhedral surfaces. Design issues considered are genericity, flexibility, time and space efficiency, and ease-of-use. We focus on topological aspects of polyhedral surfaces. Edge-based representations for polyhedrons are evaluated with respect to the design goals. A design for polyhedral surfaces in a halfedge data structure is developed following the generic programming paradigm known from the Standard Template Library STL for C++. Connections are shown to planar maps and face-based structures managing holes in facets.
[PostScript]
© ACM 1998
[--> Journal
Version]