Designing and implementing a general purpose halfedge data structure

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2141 LNCS, Issue , 2001, Pages 51-66

  Brönnimann, Hervé ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 32144434694     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44688-5_5     Document Type: Conference Paper

References (18)

1. M. H. Austern. Generic Programming and the STL. Professional computing series. Addison-Wesley, 1999.
2. B. G. Baumgart. A polyhedron representation for computer vision. In Proc. AFIPS Natl. Comput. Conf., volume 44, pages 589-596. AFIPS Press, Arlington, Va., 1975.
3. J.-D. Boissonnat, O. Devillers, M. Teillaud, and M. Yvinec. Triangulations in CGAL. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 11-18, 2000.
4. E. Brisson. Representingg eometric structures in d dimensions: Topology and order. Discrete Comput. Geom., 9:387-426, 1993.
5. C. Burnikel. Delaunay graphs by divide and conquer. Research Report MPI-I-98-1-027, Max-Planck-Institut für Informatik, Saarbrücken, 1998. 24 pages.
6. D. Cazier and J.-F. Dufourd. Rewriting-based derivation of efficient algorithms to build planar subdivisions. In Werner Purgathofer, editor, 12th Spring Conference on Computer Graphics, pages 45-54, 1996.
7. The CGAL Reference Manual, 1999. Release 2.0.
8. J. O. Coplien. Multi-Paradigm Design for C++. Addison-Wesley, 1999.
9. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.
10. E. Flato, D. Halperin, I. Hanniel, and O. Nechushtan. The design and implementation of planar maps in CGAL. In Abstracts 15th European Workshop Comput. Geom., pages 169-172. INRIA Sophia-Antipolis, 1999.
11. L. J. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graph., 4(2):74-123, April 1985.
12. L. Kettner. Using generic programming for designing a data structure for polyhedral surfaces. Comput. Geom. Theory Appl., 13:65-90, 1999.
13. L.-Q. Lee, J. G. Siek, and A. Lumsdaine. The generic graph component library. In Proceedings OOPSLA'99, 1999.
14. K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK, 1999.
15. D. E. Muller and F. P. Preparata. Finding the intersection of two convex polyhedra. Theoret. Comput. Sci., 7:217-236, 1978.
16. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 3rd edition, October 1990.
17. J. Siek and A. Lumsdaine. Concept checking: Binding parametric polymorphism in C++. In First Workshop on C++ Template Programming, Erfurt, Germany, October 10 2000.
18. K. Weiler. Topological Structures for Geometric Modeling. PhD thesis, Rensselaer Polytechnic Institute, Troy, NY, August 1986.