BACK TO INDEX

CGAL Publications sorted by year


Only publications that are directly related with current CGAL packages are reported here.

2009
  1. T. Galkovskyi, B. Gärtner, and B. Rublev. The domination heuristic for LP-type problems. In Proc. Workshop on Algorithm Engineering & Experiments (ALENEX), 2009. Keyword(s): _Optimization_. [bibtex-key = cgal:ggr-dhlptp-08 - bibtex file]


2008
  1. Frédéric Cazals and Marc Pouget. Algorithm 889: Jet_fitting_3:---A Generic C++ Package for Estimating the Differential Properties on Sampled Surfaces via Polynomial Fitting. ACM Transactions on Mathematical Software, 35(3):1-20, 2008. [WWW] Keyword(s): _GeometryProcessing_. [bibtex-key = cgal:fc-mp-jet-toms-08 - bibtex file]


  2. Pedro M. M. de Castro, Frédéric Cazals, Sébastien Loriot, and Monique Teillaud. Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere. Computational Geometry: Theory and Applications, 2008. Note: To appear. Keyword(s): _Kernel_. [bibtex-key = cgal:cclt-dc3sk-08 - bibtex file]


  3. Efi Fogel and Dan Halperin. Polyhedral Assembly Partitioning with Infinite Translations or The Importance of Being Exact. In Proceedings of 8th Workshop on Algorithmic Foundations of Robotics (WAFR), 2008. [WWW] Keyword(s): _Arrangements_. [bibtex-key = cgal:fh-papit-08 - bibtex file]


  4. Efi Fogel, Ophir Setter, and Dan Halperin. Exact Implementation of Arrangements of Geodesic Arcs on the Sphere with Applications. In Abstracts of 24th European Workshop on Computational Geometry, pages 83-86, 2008. [WWW] Keyword(s): _Arrangements_. [bibtex-key = cgal:fsh-eiaga-08 - bibtex file]


  5. Efi Fogel, Ophir Setter, and Dan Halperin. Movie: Arrangements of Geodesic Arcs on the Sphere. In Proceedings of 24th Annual Symposium on Computational Geometry (SoCG), pages 218-219, 2008. Association for Computing Machinery (ACM) Press. [WWW] Keyword(s): _Arrangements_. [bibtex-key = cgal:fsh-agas-08 - bibtex file]


2007
  1. Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Michael Seel. An Adaptable and Extensible Geometry Kernel. Computational Geometry Theory and Applications, 38(1--2):16-36, 2007. [WWW] Keyword(s): _Kernel_, _Design_. [bibtex-key = cgal:hhkps-aegk-07]


  2. Laurent Rineau and Mariette Yvinec. A generic software design for Delaunay refinement meshing. Computational Geometry Theory and Applications, 38(1-2):100 - 110, 2007. Note: Special Issue on CGAL. [WWW] Keyword(s): _Triangulations_. [bibtex-key = cgal:ry-gsddr-07]


  3. Pedro M. M. de Castro, Sylvain Pion, and Monique Teillaud. Exact and efficient computations on circles in CGAL. In Abstracts 23rd. European Workshop on Computational Geometry, pages 219-222, 2007. Technische Universität Graz, Austria. Note: Also INRIA Research Report 6091. [WWW] Keyword(s): _Kernel_. [bibtex-key = cgal:cpt-eeccc-07b]


2006
  1. Efi Fogel and Monique Teillaud. Generic Programming and The CGAL Library. In Jean-Daniel Boissonnat and Monique Teillaud, editors, Effective Computational Geometry for Curves and Surfaces, pages 313-320. Springer-Verlag, Mathematics and Visualization, 2006. Keyword(s): _Design_. [bibtex-key = cgal:ft-gpcl-06]


2005
  1. Michael Hoffmann. A Simple Linear Algorithm for Computing Rectilinear 3-Centers. Computational Geometry Theory and Applications, 31(3):150-165, 2005. [WWW] Keyword(s): _Optimization_. [bibtex-key = cgal:h-slacr-05]


2004
  1. Lutz Kettner and Stefan Näher. Two Computational Geometry Libraries: LEDA and CGAL. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 64, pages 1435-1463. CRC Press LLC, Boca Raton, FL, Second edition, 2004. Keyword(s): _Design_. [bibtex-key = cgal:kn-cgllc-04]


  2. Jean-Daniel Boissonnat and Julia Flötotto. A coordinate system associated with points scattered on a surface. Computer-Aided Design, 36:161-174, 2004. Keyword(s): _Triangulations_. [bibtex-key = cgal:bf-csaps-04]


  3. Ioannis Z. Emiris, Athanasios Kakargias, Sylvain Pion, Monique Teillaud, and Elias P. Tsigaridas. Towards an Open Curved Kernel. In Proceedings 20th Annual Symposium on Computational Geometry, pages 438-446, 2004. Keyword(s): _Kernel_. [bibtex-key = cgal:ekptt-tock-04]


  4. Efi Fogel, Ron Wein, and Dan Halperin. Code Flexibility and Program Efficiency by Genericity: Improving CGAL's Arrangements. In Algorithms - ESA 2004: 12th Annual European Symposium, Bergen, Norway, pages 664-676, 2004. Springer-Verlag. Keyword(s): _Arrangements_. [bibtex-key = cgal:fwh-cfpeg-04]


2003
  1. Julia Flötotto. A coordinate system associated to a point cloud issued from a manifold: definition, properties and applications. Thèse de doctorat en sciences, Université de Nice-Sophia Antipolis, France, 2003. [WWW] Keyword(s): _Triangulations_. [bibtex-key = cgal:f-csapc-03]


  2. Philippe Guigue. Constructions géométriques à précision fixée. Thèse de doctorat en sciences, Université de Nice-Sophia Antipolis, France, 2003. [WWW] Keyword(s): _Kernel_. [bibtex-key = cgal:g-cgpf-03]


  3. Philippe Guigue and Olivier Devillers. Fast and Robust Triangle-Triangle Overlap Test Using Orientation Predicates. Journal of graphics tools, 8(1):39-52, 2003. Keyword(s): _Kernel_. [bibtex-key = cgal:gd-frtto-03]


  4. Olivier Devillers and Sylvain Pion. Efficient Exact Geometric Predicates for Delaunay Triangulations. In Proc. 5th Workshop Algorithm Eng. Exper., pages 37-44, 2003. [WWW] Keyword(s): _Robustness_. [bibtex-key = cgal:dp-eegpd-03]


  5. Olivier Devillers and Monique Teillaud. Perturbations and Vertex Removal in a 3D Delaunay Triangulation. In Proc. 14th ACM-SIAM Sympos. Discrete Algorithms (SODA), pages 313-319, 2003. Keyword(s): _Triangulations_, _Robustness_. [bibtex-key = cgal:dt-pvr3d-03]


  6. K. Fischer and B. Gärtner. The smallest enclosing ball of balls: combinatorial structure and algorithms. In Proceedings 19th annual Symposium on Computational Geometry (SCG), pages 292-301, 2003. Keyword(s): _Optimization_. [bibtex-key = cgal:fg-sebbcsa-03]


  7. Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, and Michael Seel. Boolean Operations on 3D Selective Nef Complexes Data Structure, Algorithms, and Implementation. In Giuseppe Di Battista and Uri Zwick, editors, Algorithms - ESA 2003: 11th Annual European Symposium, volume 2832 of Lecture Notes in Computer Science, Budapest, Hungary, pages 174-186, September 2003. Springer. [WWW] Keyword(s): _Polygons/Polyhedra_. [bibtex-key = cgal:ghhkm-bosnc-03]


  8. Menelaos I. Karavelas and Ioannis Z. Emiris. Root comparison techniques applied to computing the additively weighted Voronoi diagram. In Proc. 14th ACM-SIAM Sympos. Discrete Algorithms (SODA), pages 320-329, 2003. Keyword(s): _Triangulations_. [bibtex-key = cgal:ke-rctac-03]


2002
  1. Sven Schönherr. Quadratic Programming in Geometric Optimization: Theory, Implementation, and Applications. PhD thesis, ETH Zürich, Zürich, Switzerland, 2002. Keyword(s): _Optimization_. [bibtex-key = cgal:s-qpgotia-02]


  2. Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Pion, Monique Teillaud, and Mariette Yvinec. Triangulations in CGAL. Comput. Geom. Theory Appl., 22:5-19, 2002. [WWW] Keyword(s): _Triangulations_. [bibtex-key = cgal:bdpty-tc-02]


  3. Olivier Devillers. The Delaunay hierarchy. Internat. J. Found. Comput. Sci., 13:163-180, 2002. Note: Special issue on triangulations. Keyword(s): _Triangulations_. [bibtex-key = d-dh-02]


  4. Olivier Devillers, Sylvain Pion, and Monique Teillaud. Walking in a triangulation. Internat. J. Found. Comput. Sci., 13:181-199, 2002. Note: Special issue on triangulations. [WWW] Keyword(s): _Triangulations_. [bibtex-key = cgal:dpt-wt-02]


  5. Dan Halperin and Eli Packer. Iterated Snap Rounding. Comput. Geom. Theory Appl., 23:209-225, 2002. Keyword(s): _Arrangements_. [bibtex-key = cgal:hp-isr-02]


  6. Menelaos Karavelas and Mariette Yvinec. Dynamic Additively Weighted Voronoi Diagrams in 2D. In Proc. 10th European Symposium on Algorithms, pages 586-598, 2002. Keyword(s): _Triangulations_. [bibtex-key = ky-dawvd-02]


  7. Ron Wein. High-Level Filtering for Arrangements of Conic Arcs. In Proc. ESA 2002, pages 884-895, 2002. Springer-Verlag. Keyword(s): _Arrangements_. [bibtex-key = cgal:w-hlfca-02]


  8. Olivier Devillers and Monique Teillaud. Perturbations and Vertex Removal in a 3D Delaunay Triangulation. Research Report 4624, INRIA, 2002. [WWW] Keyword(s): _Triangulations_, _Robustness_. [bibtex-key = cgal:dt-pvr3d-02]


  9. Ron Wein. High-Level Filtering for Arrangements of Conic Arcs. M.Sc. Thesis, School of Computer Science, Tel Aviv University, Tel Aviv, Israel, 2002. Keyword(s): _Arrangements_. [bibtex-key = cgal:w-hlfmt-02]


2001
  1. Michael Seel. Planar Nef Polyhedra and Generic High-dimensional Geometry. PhD thesis, Universität des Saarlandes, September 2001. Keyword(s): _Polygons/Polyhedra_. [bibtex-key = cgal:s-pnpgh-01]


  2. H. Brönnimann, C. Burnikel, and S. Pion. Interval arithmetic yields efficient dynamic filters for computational geometry. Discrete Applied Mathematics, 109:25-47, 2001. [WWW] Keyword(s): _Robustness_. [bibtex-key = cgal:bbp-iayed-01]


  3. Olivier Devillers, Sylvain Pion, and Monique Teillaud. Walking in a triangulation. In Proceedings 17th Annual Symposium on Computational Geometry, pages 106-114, 2001. [WWW] Keyword(s): _Triangulations_. [bibtex-key = cgal:dpt-wt-01]


  4. Dan Halperin and Eli Packer. Snap Rounding Revisited. In Abstracts 17th European Workshop Comput. Geom., pages 82-85, 2001. Freie Universität Berlin. Keyword(s): _Arrangements_. [bibtex-key = cgal:hp-srr-01]


  5. Susan Hert. Connected Area Partitioning. In Abstracts 17th European Workshop Comput. Geom., pages 35-38, 2001. Freie Universität Berlin. [WWW] Keyword(s): _Polygons/Polyhedra_. [bibtex-key = cgal:h-cap-01]


  6. Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Michael Seel. An Adaptable and Extensible Geometry Kernel. In Proc. Workshop on Algorithm Engineering, volume 2141 of Lecture Notes Comput. Sci., pages 79-90, 2001. Springer-Verlag. [WWW] Keyword(s): _Kernel_, _Design_. [bibtex-key = cgal:hhkps-aegk-01]


  7. Kurt Mehlhorn and Michael Seel. Infimaximal Frames: A Technique for Making Lines Look Like Segments. In Abstracts 17th European Workshop Comput. Geom., pages 78-81, 2001. Freie Universität Berlin. Keyword(s): _Polygons/Polyhedra_. [bibtex-key = cgal:ms-iftml-01]


  8. Michael Seel. Implementation of Planar Nef Polyhedra. Research Report MPI-I-2001-1-003, Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany, August 2001. [WWW] Keyword(s): _Polygons/Polyhedra_. [bibtex-key = cgal:s-ipnp-01]


2000
  1. A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, and S. Schönherr. On the Design of CGAL, a Computational Geometry Algorithms Library. Softw. -- Pract. Exp., 30(11):1167-1202, 2000. Note: Special Issue on Discrete Algorithm Engineering. [WWW] Keyword(s): _Design_. [bibtex-key = cgal:fgkss-dccga-00]


  2. Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, and Ester Ezra. The Design and Implementation of Planar Maps in CGAL. The ACM Journal of Experimental Algorithmics, 5, 2000. Note: Also in LNCS Vol. 1668 (WAE '99), pages 154--168. Keyword(s): _Arrangements_. [bibtex-key = cgal:fhhne-dipmc-00]


  3. Hannah Bast and Susan Hert. The Area Partitioning Problem. In Proc. 12th Canad. Conf. Comput. Geom., pages 163-172, 2000. [WWW] Keyword(s): _Polygons/Polyhedra_. [bibtex-key = cgal:bh-app-00]


  4. Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud, and Mariette Yvinec. Triangulations in CGAL. In Proceedings 16th Annual Symposium on Computational Geometry, pages 11-18, 2000. Keyword(s): _Triangulations_. [bibtex-key = cgal:bdty-tcgal-00]


  5. Hervé Brönnimann, Lutz Kettner, Stefan Schirra, and Remco Veltkamp. Applications of the Generic Programming Paradigm in the Design of CGAL. In M. Jazayeri, R. Loos, and D. Musser, editors, Generic Programming---Proceedings of a Dagstuhl Seminar, LNCS 1766, pages 206-217, 2000. Springer-Verlag. [WWW] Keyword(s): _Design_. [bibtex-key = cgal:bksv-agppd-00]


  6. Bernd Gärtner and Sven Schönherr. An Efficient, Exact, and Generic Quadratic Programming Solver for Geometric Optimization. In Proceedings 16th Annual Symposium on Computational Geometry, pages 110-118, 2000. Keyword(s): _Optimization_. [bibtex-key = cgal:gs-eegqp-00]


  7. Iddo Hanniel and Dan Halperin. Two-dimensional arrangements in CGAL and adaptive point location for parametric curves. In LNCS Vol. 1982 (Proc. WAE '00), pages 171-182, 2000. Springer-Verlag. Keyword(s): _Arrangements_. [bibtex-key = cgal:hh-tdaca-00]


  8. M. Seel and K. Mehlhorn. Infimaximal Frames: A Technique for Making Lines Look Like Segments. Research Report MPI-I-2000-1-005, MPI für Informatik, Saarbrücken, Germany, December 2000. Note: |www.mpi-sb.mpg.de/ mehlhorn/ftp/InfiFrames.ps|. Keyword(s): _Polygons/Polyhedra_. [bibtex-key = cgal:sm-iftml-00]


  9. Iddo Hanniel. The Design and Implementation of Planar Arrangements of Curves in CGAL. M.Sc. Thesis, School of Computer Science, Tel Aviv University, 2000. Keyword(s): _Arrangements_. [bibtex-key = cgal:h-dipac-00]


1999
  1. Lutz Kettner. Software Design in Computational Geometry and Contour-Edge Based Polyhedron Visualization. PhD thesis, ETH Zurich, Switzerland, 1999. Note: DISS. ETH No. 13325. [WWW] Keyword(s): _Polygons/Polyhedra_, _I/O_, _Design_. [bibtex-key = cgal:k-sdcgc-99]


  2. Sylvain Pion. De la géométrie algorithmique au calcul géométrique. Thèse de doctorat en sciences, Université de Nice-Sophia Antipolis, France, 1999. Note: TU-0619. [WWW] Keyword(s): _Robustness_. [bibtex-key = cgal:p-gacg-99]


  3. Lutz Kettner. Using generic programming for designing a data structure for polyhedral surfaces. Comput. Geom. Theory Appl., 13:65-90, 1999. [WWW] Keyword(s): _Polygons/Polyhedra_, _Design_. [bibtex-key = cgal:k-ugpdd-99]


  4. B. Gärtner. Fast and robust smallest enclosing balls. In Proc. 7th annu. European Symposium on Algorithms (ESA), volume 1643 of Lecture Notes in Computer Science, pages 325-338, 1999. Springer-Verlag. Keyword(s): _Optimization_. [bibtex-key = cgal:g-frseb-99]


  5. Michael Hoffmann. A Simple Linear Algorithm for Computing Rectangular Three-Centers. In Proc. 11th Canad. Conf. Comput. Geom., pages 72-75, 1999. Keyword(s): _Optimization_. [bibtex-key = cgal:h-slacr-99]


  6. Sylvain Pion. Interval Arithmetic: An efficient implementation and an application to computational geometry. In Workshop on Applications of Interval Analysis to systems and Control, pages 99-110, 1999. [WWW] Keyword(s): _Robustness_. [bibtex-key = cgal:p-iaeia-99]


  7. Stefan Schirra. A Case Study on the Cost of Geometric Computing. In Algorithm Engineering and Experimentation (ALENEX99), pages 156-176, 1999. Springer, Berlin. Note: LNCS 1619. Keyword(s): _Kernel_, _Convex_Hull_. [bibtex-key = cgal:s-cscgc-99]


  8. Monique Teillaud. Three Dimensional Triangulations in CGAL. In Abstracts 15th European Workshop Comput. Geom., pages 175-178, 1999. INRIA Sophia-Antipolis. [WWW] Keyword(s): _Triangulations_. [bibtex-key = cgal:t-tdtc-99]


1998
  1. B. Gärtner and S. Schönherr. Exact Primitives for Smallest Enclosing Ellipses. Information Processing Letters, 68:33-38, 1998. Keyword(s): _Optimization_. [bibtex-key = cgal:gs-epsee-98]


  2. Susan Hert and Vladimit Lumelsky. Polygon Area Decomposition for Multiple-Robot Workspace Division. Internat. J. Comput. Geom. Appl., 8(4):437-466, 1998. Keyword(s): _Polygons/Polyhedra_. [bibtex-key = cgal:hl-padmr-98]


  3. Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, and Joachim Ziegler. A Computational Basis for Higher-Dimensional Computational Geometry and Applications. Comput. Geom. Theory Appl., 10(4):289-303, 1998. Keyword(s): _Kernel_. [bibtex-key = cgal:mmnssuz-cbhdc-98]


  4. Hervé Brönnimann, Christoph Burnikel, and Sylvain Pion. Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry. In Proceedings 14th Annual Symposium on Computational Geometry, pages 165-174, 1998. [WWW] Keyword(s): _Robustness_. [bibtex-key = cgal:bbp-iayed-98]


  5. Lutz Kettner. Designing a data structure for polyhedral surfaces. In Proceedings 14th Annual Symposium on Computational Geometry, pages 146-154, 1998. [WWW] Keyword(s): _Polygons/Polyhedra_, _Design_. [bibtex-key = cgal:k-ddsps-98]


  6. Bernd Gärtner and Sven Schönherr. Smallest Enclosing Circles - An Exact and Generic Implementation in C++. Technical report B-98-05, Institute for Computer Science, 1998. Keyword(s): _Optimization_. [bibtex-key = cgal:gs-secegic-98]


  7. Stefan Schirra. Parameterized Implementations of Classical Planar Convex Hull Algorithms and Extreme Point Computations. Research Report MPI-I-98-1-003, Max-Planck-Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany, January 1998. [WWW] Keyword(s): _Kernel_, _Convex_Hull_. [bibtex-key = cgal:s-picpc-98]


1997
  1. Lutz Kettner. Visualisation and Simulation. In CGAL Workpackage 4: Report 2, chapter 2, pages 12-17. The CGAL Consortium, Fall 1997. [WWW] Keyword(s): _I/O_. [bibtex-key = cgal:k-vs-97]


  2. Stefan Schirra. Precision and Robustness in Geometric Computations. In Marc van Kreveld, Jürg Nievergelt, Thomas Roos, and Peter Widmayer, editors, Algorithmic foundations of geographic information systems, volume 1340 of Lecture Notes in Computer Science, pages 255-287. Springer-Verlag, Berlin, 1997. Keyword(s): _Kernel_, _Design_. [bibtex-key = cgal:s-prgc-97]


  3. Mark de Berg and Lutz Kettner. Visualisation and Simulation. In CGAL Workpackage 4: Report 1, chapter 3, pages 20-24. The CGAL Consortium, April 1997. [WWW] Keyword(s): _I/O_. [bibtex-key = cgal:bk-vs-97]


  4. Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, and Joachim Ziegler. A computational basis for higher dimensional computational geometry and Applications. In Proceedings 13th Annual Symposium on Computational Geometry, pages 254-263, 1997. Keyword(s): _Kernel_. [bibtex-key = cgal:mmnssuz-cbhdc-97]


  5. R. C. Veltkamp. Generic Programming in CGAL, the Computational Geometry Algorithms Library. In Proc. 6th Eurographics Workshop on Programming Paradigms in Graphics, Budapest, Hungary, 8 September 1997, pages 127-138, 1997. Keyword(s): _Design_. [bibtex-key = cgal:v-gpcgal-97]


1996
  1. Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, and Sven Schönherr. The CGAL Kernel: A Basis for Geometric Computation. In M. C. Lin and D. Manocha, editors, Proc. 1st ACM Workshop on Appl. Comput. Geom., volume 1148 of Lecture Notes Comput. Sci., pages 191-202, 1996. Springer-Verlag. [WWW] Keyword(s): _Kernel_, _Design_. [bibtex-key = cgal:fgkss-ckbgc-96]


  2. Mark H. Overmars. Designing the Computational Geometry Algorithms Library CGAL. In M. C. Lin and D. Manocha, editors, ACM Workshop on Applied Computational Geometry, Philadelphia, Pennsylvenia, May, 27--28 1996. Note: Lecture Notes in Computer Science 1148. Keyword(s): _Design_. [bibtex-key = cgal:o-dcgal-96]


  3. Michael Schutte. Zufällige Konvexe Mengen. Master's thesis, Freie Universität Berlin, Germany, 1996. Keyword(s): _Convex_Hull_. [bibtex-key = cgal:s-zkm-96]


  4. Stefan Schirra. Designing a Computational Geometry Algorithms Library. Lecture Notes for Advanced School on Algorithmic Foundations of Geographic Information Systems, CISM, Udine, September 16-20 1996. [WWW] Keyword(s): _Design_. [bibtex-key = cgal:s-dcgal-96]



BACK TO INDEX




Disclaimer:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.




This document was translated from BibTEX by bibtex2html