Using generic programming for designing a data structure for polyhedral surfaces

Computational Geometry: Theory and Applications

Volumn 13, Issue 1, 1999, Pages 65-90

  Kettner, Lutz ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Combinatorial data structure; Generic programming; Halfedge data structure; Library design; Polyhedral surface

Indexed keywords

EID: 0003651525     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00007-3     Document Type: Article

References (37)

1. B.G. Baumgart, A polyhedron representation for computer vision, in: National Computer Conference, AFIPS, Anaheim, CA, 1975, pp. 589-596.
2. H. Bendels, D.W. Fellner, S. Havemann, Modellierung der Grundlagen: Erweiterbare Datenstrukturen zur Modellierung und Visualisierung polygonaler Welten, in: D.W. Fellner (Ed.), Modeling - Virtual Worlds -Distributed Graphics, Bad Honnef/Bonn, November 1995, pp. 149-157.
3. H. Brönnimann, S. Schirra, R. Veltkamp, M. Yvinec (Eds.), CGAL Reference Manual, CGAL R1.2, January 1999.
4. J.O. Coplien, Curiously recurring template patterns, C++ Report, February 1995, pp. 24-27.
5. M. de Berg, M. van Krefeld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer, 1997.
6. A. Fabri, G. Giezeman, L. Kettner, S. Schirra, S. Schönherr, The CGAL kernel: A basis for geometric computation, in: M.C. Lin and D. Manocha (Eds.), ACM Workshop on Applied Computational Geometry, Philadelphia, PA, 27-28 May 1996, Lecture Notes in Computer Science, Vol. 1148, pp. 191-202.
7. A. Fabri, G. Giezeman, L. Kettner, S. Schirra, S. Schönherr, On the design of CGAL, the computational geometry algorithms library, Software - Practice and Experience, 1999, to appear.
8. E. Gamma, R. Helm, R. Johnson, J. Vlissidis, Design Patterns - Elements of Reusable Object-Oriented Software, Addison-Wesley, Reading, MA, 1995.
9. G. Giezeman, R. Veltkamp, W. Wesselink, Getting Started with CGAL, CGAL R1.2, January 1999.
10. A.S. Glassner, Maintaining winged-edge models, in: J. Arvo (Ed.), Graphics Gems II, Academic Press, New York, 1991, pp. 191-201.
11. L. Guibas, J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. Graphics 4 (3) (1985) 74-123.
12. J. Hartman, J. Wernecke, The VRML 2.0 Handbook: Building Moving Worlds on the Web, Addison-Wesley, Reading, MA, 1996.
13. C.M. Hoffmann, Geometric and Solid Modeling - An Introduction, Morgan Kaufmann, San Mateo, CA, 1989.
14. M. Hoffmann, Line-Sweep auf einem Gitter, Diplomarbeit, Freie Universität Berlin, Germany, 1996.
15. International Standard ISO/IEC 14882: Programming Languages - C++. American National Standards Institute, New York, 1998.
16. L. Kettner, Designing a data structure for polyhedral surfaces, in: Proc. 14th Annu. ACM Sympos. Comput. Geom., 1998, pp. 146-154.
17. L. Kettner, E. Welzl, Contour edge analysis for polyhedron projections, in: W Straßer, R. Klein, R. Rau (Eds.), Geometric Modeling: Theory and Practice, Springer, 1997. (Proc. Internat. Conf. Theory and Practice of Geometric Modeling in Blaubeuren, Germany, October 1996.)
18. L. Kettner, E. Welzl, Contour edge analysis for polyhedron projections, in: W Straßer, R. Klein, R. Rau (Eds.), Geometric Modeling: Theory and Practice, Springer, 1997. (Proc. Internat. Conf. Theory and Practice of Geometric Modeling in Blaubeuren, Germany, October 1996.)
19. J. Lakos, Large Scale C++ Software Design, Addison-Wesley, Reading, MA, 1996.
20. S.B. Lippman, Inside the C++ Object Model, Addison-Wesley, Reading, MA, 1996.
21. M. Mäntylä, An Introduction to Solid Modeling, Computer Science Press, Rockville, MD, 1988.
22. K. Mehlhorn, S. Näher, LEDA: A platform for combinatorial and geometric computing, Comm. ACM 38 (1) (1995) 96-102.
23. K. Mehlhorn, S. Näher, C. Uhrig, The LEDA User Manual, Version 3.5, LEDA Software GmbH, Saarbrücken, Germany, 1997.
24. D.E. Muller, F.P. Preparata, Finding the intersection of two convex polyhedra, Theor. Comput. Sci. 7 (1978) 217-236.
25. D.R. Musser, A. Saini, STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library, Addison-Wesley, Reading, MA, 1996.
26. D.R. Musser, A.A. Stepanov, Generic programming, in: Proc. 1st Internat. Joint Conf. of ISSAC-88 and AAEC-6, Lecture Notes in Computer Science, Vol. 358, Springer, 1989, pp. 13-25.
27. D.R. Musser, A.A. Stepanov, Algorithm-oriented generic libraries, Software - Practice and Experience 24 (7) (1994) 623-642.
28. N.C. Myers, Traits: a new and useful template technique, C++ Report, June 1995.
29. M.H. Overmars, Designing the computational geometry algorithms library CGAL, in: M.C. Lin and D. Manocha (Eds.), ACM Workshop on Applied Computational Geometry, Philadelphia, PA, 27-28 May 1996, Lecture Notes in Computer Science, Vol. 1148.
30. M. Phillips, Geomview Manual: Geomview Version 1.5 for Silicon Graphics Workstations, The Geometry Center, University of Minnesota, October 1994.
31. S. Schirra, A case study on the cost of geometric computing, in: Proc. of ALENEX'99, 1999, to appear.
32. Silicon Graphics Computer Systems, Inc., Standard template library programmer's guide, http:// www.sgi.com/Technology/STL/, 1997.
33. E. Steinitz, H. Rademacher, Vorlesung über die Theorie der Polyeder (unter Einschluß der Elemente der Topologie), Springer, 1934.
34. A.A. Stepanov, M. Lee, The Standard template library, http://www.cs.rpi.edu/~musser/doc.ps, October 1995.
35. B. Stroustrup, The C++ Programming Language, 3rd Edition, Addison-Wesley, Reading, MA, 1997.
36. K. Weiler, Edge-based data structures for solid modeling in curved-surf ace environments, IEEE Comput. Graphics Appl. 5 (1) (1985) 21-40.
37. J. Wernicke, The Inventor Mentor: Programming Object-Oriented 3D Graphics with Open Inventor, Release 2, Addison-Wesley, Reading, MA, 1994.