Navigation: Table of Contents, Bibliography, Index, Title Page

Reference Manual
Bibliography

[AKM+87] A. Aggarwal, M. M. Klawe, S. Moran, P. Shor, and R. Wilber. Geometric applications of a matrix-searching algorithm. Algorithmica, 2:195-208, 1987.
[And78] K. R. Anderson. A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set. Inform. Process. Lett., 7(1):53-55, 1978.
[And79] A. M. Andrew. Another efficient algorithm for convex hulls in two dimensions. Inform. Process. Lett., 9(5):216-219, 1979.
[AT78] S. G. Akl and G. T. Toussaint. A fast convex hull algorithm. Inform. Process. Lett., 7(5):219-222, 1978.
[Bau75] B. G. Baumgart. A polyhedron representation for computer vision. In Proc. AFIPS Natl. Comput. Conf., volume 44, pages 589-596, 1975.
[BFH95] H. Bendels, D. W. Fellner, and S. Havemann. Modellierung der grundlagen: Erweiterbare datenstrukturen zur modellierung und visualisierung polygonaler welten. In D. W. Fellner, editor, Modeling - Virtual Worlds - Distributed Graphics , pages 149-157, Bad Honnef / Bonn, 27-28 November 1995.
[BPP95] G. Bell, A. Parisi, and M. Pesce. Vrml the virtual reality modeling language: Version 1.0 specification. http://www.vrml.org/, May 26 1995. Third Draft.
[Byk78] A. Bykat. Convex hull of a finite set of points in two dimensions. Inform. Process. Lett., 7:296-298, 1978.
[dBvKOS97] M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Heidelberg, Germany, 1997.
[Edd77] W. F. Eddy. A new convex hull algorithm for planar sets. ACM Trans. Math. Softw., 3:398-403 and 411-412, 1977.
[FH95] U. Finke and K. Hinrichs. Overlaying simply connected planar subdivisions in linear time. In Proc. 11th Annu. ACM Sympos. Computational Geometry page 119-126, 1995.
[FJ83] G. N. Frederickson and D. B. Johnson. Finding kth paths and p-centers by generating and searching good data structures. J. Algorithms, 4:61-80, 1983.
[FJ84] G. N. Frederickson and D. B. Johnson. Generalized selection and ranking: sorted matrices. SIAM J. Comput., 13:14-30, 1984.
[GHJV95] E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns - Elements of Reusable Object-Oriented Software . Addison-Wesley, 1995.
[Gra72] R. L. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Inform. Process. Lett., 1:132-133, 1972.
[GS85] L. J. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graph., 4:74-123, 1985.
[GS97a] B. Gärtner and S. Schönherr. Exact primitives for smallest enclosing ellipses. In Proc. 13th Annu. ACM Symp. on Computational Geometry, pages 430-432, 1997.
[GS97b] B. Gärtner and S. Schönherr. Smallest enclosing ellipses - fast and exact. Serie B - Informatik B 97-03, Freie Universität Berlin, Germany, June 1997.
[GS98a] B. Gärtner and S. Schönherr. Smallest enclosing circles - an exact and generic implementation in C++. Serie B - Informatik B 98-04, Freie Universität Berlin, Germany, April 1998. URL http://www.inf.fu-berlin.de/inst/pubs/tr-b-98-04.abstract.html .
[GS98b] B. Gärtner and S. Schönherr. Smallest enclosing ellipses - an exact and generic implementation in C++. Serie B - Informatik B 98-05, Freie Universität Berlin, Germany, April 1998. URL http://www.inf.fu-berlin.de/inst/pubs/tr-b-98-05.abstract.html .
[Hai94] E. Haines. Point in polygon strategies. In Paul Heckbert, editor, Graphics Gems IV, pages 24-46. Academic Press, Boston, MA, 1994.
[Jar73] R. A. Jarvis. On the identification of the convex hull of a finite set of points in the plane. Inform. Process. Lett., 2:18-21, 1973.
[Ket98] L. Kettner. Designing a data structure for polyhedral surfaces. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 146-154, 1998.
[KW97] D. Kühl and K. Weihe. Data access templates. C++ Report, June 1997.
[Män88] M. Mäntylä. An Introduction to Solid Modeling . Computer Science Press, Rockville, MD, 1988.
[Meh84] K. Mehlhorn. Multi-dimensional Searching and Computational Geometry, volume 3 of Data Structures and Algorithms . Springer-Verlag, Heidelberg, West Germany, 1984.
[MMN+97] K. Mehlhorn, M. Müller, S. Näher, S. Schirra, M. Seel, C. Uhrig, and J. Ziegler. A computational basis for higher dimensional computational geometry and applications. In Proceedings of the 13th ACM Symposium on Computational Geometry, pages 254-263, 1997.
[MP78] D. E. Muller and F. P. Preparata. Finding the intersection of two convex polyhedra. Theoret. Comput. Sci., 7:217-236, 1978.
[MS96] D. R. Musser and A. Saini. STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library. Addison-Wesley, 1996.
[Mul90] K. Mulmuley. A fast planar partition algorithm, I. J. Symbolic Comput., 10(3-4):253-280, 1990.
[Phi94] M. Phillips. Geomview Manual, Version 1.5 for Silicon Graphics Workstations. The Geometry Center, University of Minnesota, October 1994. http://www.geom.umn.edu/software/download/geomview.html .
[PS85] F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
[Sam90] H. Samet. Design and Analysis of Spatial Data Structures . Addison-Wesley, Reading, MA, 1990.
[Sei91] R. Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl., 1(1):51-64, 1991.
[SL95] A. Stepanov and M. Lee. The standard template library. http://www.cs.rpi.edu/~musser/doc.ps , October 1995.
[SW96] M. Sharir and E. Welzl. Rectilinear and polygonal p-piercing and p-center problems. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 122-132, 1996.
[VRM96] The virtual reality modeling language specification: Version 2.0, ISO/ IEC CD 14772. http://www.vrml.org/ , August 4 1996.
[Wei85] K. Weiler. Edge-based data structures for solid modeling in curved-surface environments. IEEE Computer Graphics and Application, 5(1):21-40, January 1985.
[Wel91] E. Welzl. Smallest enclosing disks (balls and ellipsoids). In H. Maurer, editor, New Results and New Trends in Computer Science, volume 555 of Lecture Notes Comput. Sci., pages 359-370. Springer-Verlag, 1991.
[Wer94] J. Wernicke. The Inventor Mentor: Programming Object-Oriented 3D Graphics with Open Inventor, Release 2. Addison-Wesley, 1994.
Navigation: Table of Contents, Bibliography, Index, Title Page
The CGAL Project. 22 January, 1999.