Generic Programming Techniques that Make Planar Cell Complexes Easy to Use ", G.Ber/n:axtd, A.Imiya, R.Klette (eds [1 citations — 1 self]
Abstract:
Abstract: 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 algoritStms on top of cell complexes. We propose to use generic programming to design cell complex data stxuctures 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.
Citations
| 59 | Finite Topology as Applied to Image Analysis – Kovalevsky - 1989 |
| 32 | Computer graphics and connected topologies on finite ordered sets – Khalimsky, Kopperman, et al. - 1990 |
| 23 | Designing a data structure for polyhedral surfaces – Kettner - 1998 |
| 4 | Vlissides: "Design Patterns – Gamma, Helm, et al. - 1994 |
| 2 | Puitg: "functional specificat'on and prototyping with oriented combinatotial maps", Computational Geometry 16 – Dufourd, F - 2000 |
| 2 | Generische Programmierungfiir die Bildverarbeitung – KOthe - 2000 |
| 2 | Computergestiitzte Untersuchung topologischer Eigenschafien mehrdimensionaler R8ume – Kovalevsky - 2000 |
| 1 | Austern: "Generic Programming and the STL – unknown authors - 1998 |
| 1 | Generic Software Components for Scien,fic Comput'ng – Berti |
| 1 | Data Access Templates ", C--Report Magazine – KCthl, Weihe - 1997 |
| 1 | ln Introduction to SolidModeling – Mfintyli - 1988 |
| 1 | Stepanov: 'llgotithm-Otiented Generic Libraties – Musser, A - 1994 |

