Designing a Data Structure for Polyhedral Surfaces (1998)
Cached
Download Links
- [www.cs.unc.edu]
- [www.cs.unc.edu]
- [www.mpi-sb.mpg.de]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. 14th Annu. ACM Sympos. Comput. Geom |
| Citations: | 28 - 2 self |
BibTeX
@INPROCEEDINGS{Kettner98designinga,
author = {Lutz Kettner},
title = {Designing a Data Structure for Polyhedral Surfaces},
booktitle = {In Proc. 14th Annu. ACM Sympos. Comput. Geom},
year = {1998},
pages = {146--154}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. 1 Introduction Combinatorial structures, such as planar maps, are fundamental in computational geometry. In order to use computational geometry in practice, a solid library must provide generic and flexible solutions as one of its fundamental cornerstones. Other design criteria are time and space efficiency. Ease-of-use is necessar...
