Abstract
Cell complexes are potentially very useful in many fields, including image segmentation, numerical analysis, and computer graph- ics. 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Austern: “Generic Programming and the STL”, Reading: Addison-Wesley, 1998
G. Berti: “Generic Software Components for Scientific Computing”, PhD thesis, Fakultät für Mathematik, Naturwissenschaften und Informatik, Brandenburgische Technische Universität Cottbus, 2000
J.-F. Dufourd, F. Puitg: “Functional specification and prototyping with oriented combinatorial maps”, Computational Geometry 16 (2000) 129–156
E. Gamma, R. Helm, R. Johnson, J. Vlissides: “Design Patterns”, Addison-Wesley, 1994
L. Kettner: “Designing a Data Structure for Polyhedral Surfaces”, Proc. 14 th ACM Symp. on Computational Geometry, New York: ACM Press, 1998
E. Khalimsky, R. Kopperman, P. Meyer: “Computer Graphics and Connected Topologies on Finite Ordered Sets”, J. Topology and its Applications, vol. 36, pp. 1–27, 1990
U. Köthe: “Generische Programmierung für die Bildverarbeitun”, PhD thesis, Computer Science Department, University of Hamburg, 2000 (in German)
V. Kovalevsky: “Finite Topology as Applied to Image Analysisly, Computer Vision, Graphics, and Image Processing, 46(2), pp. 141–161, 1989
V. Kovalevsky: “Computergestützte Untersuchung topologischer Eigenschaften mehrdimensionaler Räume”, Preprints CS-03-00, Computer Science Department, University of Rostock, 2000 (in German)
D. Kühl, K. Weihe: “Data Access Templates”, C++ Report Magazine, July/August 1997
M. Mäntylä:“An Introduction to Solid Modeling”, Computer Science Press, 1988
D. Musser, A. Stepanov: “Algorithm-Oriented Generic Libraries”, Software-Practice and Experience, 24(7), 623–642, 1994
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Köthe, U. (2001). Generic Programming Techniques that Make Planar Cell Complexes Easy to Use. In: Bertrand, G., Imiya, A., Klette, R. (eds) Digital and Image Geometry. Lecture Notes in Computer Science, vol 2243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45576-0_2
Download citation
DOI: https://doi.org/10.1007/3-540-45576-0_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43079-7
Online ISBN: 978-3-540-45576-9
eBook Packages: Springer Book Archive