Introduction to Solid Modeling
Introduction to Solid Modeling
Finite topology as applied to image analysis
Computer Vision, Graphics, and Image Processing
Algorithm-oriented generic libraries
Software—Practice & Experience
Designing a data structure for polyhedral surfaces
Proceedings of the fourteenth annual symposium on Computational geometry
Generic programming and the STL: using and extending the C++ Standard Template Library
Generic programming and the STL: using and extending the C++ Standard Template Library
Functional specification and prototyping with oriented combinatorial maps
Computational Geometry: Theory and Applications
XPMaps and Topological Segmentation - A Unified Approach to Finite Topologies in the Plane
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Milena: Write Generic Morphological Algorithms Once, Run on Many Kinds of Images
ISMM '09 Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing
| Hi-index | 0.00 |
Cell complexes are potentially very useful in many fields, including image segmentation, numerical analysis, and computer graphics. However, in practice they are not used as widely as they could be. This is partly due to the difficulties in actually implementing algorithms on top of cell complexes. We propose to use generic programming to design cell complex data structures that are easy to use, efficient, and flexible. The implementation of the new design is demonstrated for a number of common cell complex types and an example algorithm.