Y. Aharoni, D. Halperin, I. Hanniel, S. Har-Peled, and C. Linhart. On-line zone construction in arrangements of lines in the plane. In Algorithm Engineering, WAE99, Lecture Notes in Comp. Science Vol. 1668, Springer Verlag, 1999, pages 139-153.

J.-D. Boissonnat, F. Cazals, F. Da, O. Devillers, S. Pion, F. Rebufat, M. Teillaud, and M. Yvinec. Programming with CGAL: the example of triangulations. In Proc. 15th Annu. ACM Sympos. Comput. Geom., 1999, pages 421-422.

J.-D. Boissonnat and J. Snoeyink. Line and curve segment intersection with restricted predicates. In Proc. 15th Annu. ACM Sympos. Comput. Geom., 1999, pages 370-379.

C. Burnikel, R. Fleischer, K. Mehlhorn, and S. Schirra. Efficient exact geometric computation made easy. In Proc. 15th Annu. ACM Sympos. Comput. Geom., 1999, pages 341-350.

C. Burnikel, S. Funke, and M. Seel. Exact geometric computation using Cascading. To appear in International Journal of Computational Geometry & Applications.

J. Comes and M. Ziegelmann. An easy to use implementation of linear perturbations within CGAL. In Algorithm Engineering, WAE99, Lecture Notes in Comp. Science Vol. 1668, Springer Verlag, 1999, pages 169-182.

O. Devillers. On deletion in Delaunay triangulation. In Proc. 15th Annu. ACM Sympos. Comput. Geom., 1999, pages 181-188.

O. Devillers and P.-M. Gandoin. Rounding Voronoi diagram. Research Report 3481, INRIA, 1998.

O. Devillers and P.-M. Gandoin. Rounding Voronoi diagram. In Proc. 8th Discrete Geometry and Computational Imagery conference (DGCI99), Lecture Notes in Comp. Science Vol. 1568, Springer-Verlag, 1999, pages 375-387. Also presented at 15th European Workshop Comput. Geom., March 1999.

O. Devillers and F. Preparata. Further results on arithmetic filters for geometric predicates. 15th European Workshop Comput. Geom., 1999

O. Devillers and F. Preparata. Further results on arithmetic filters for geometric predicates. Rapport de recherche 3528, INRIA, 1998.

A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, and S. Schönherr. On the Design of CGAL, a Computational Geometry Algorithms Library. Software - Practice & Experience, special issue on Algorithm Engineering edited by Dorothea Wagner and Karsten Weihe (Eds.), to appear.

E. Flato, D. Halperin, I. Hanniel, and O. Nechushtan. The design and implementation of planar maps in CGAL. In Algorithm Engineering, WAE99, Lecture Notes in Comp. Science Vol. 1668, Springer Verlag, 1999, pages 154-168. Also presented at 15th European Workshop Comput. Geom., March 1999.

S. Funke, K. Mehlhorn, and S. Näher. Structural Filtering - A Paradigm for Efficient and Exact Geometric Programs. 11th Canadian Conference on Computational Geometry, 1999.

B. Gärtner. Fast and robust smallest enclosing balls. In Proc. 7th Annu. European Symposium on Algorithms, ESA99, Springer Lecture Notes in Comp. Science Vol. 1643, 1999. pages 325-338.

M. Hoffmann. A Simple Linear Algorithm for Computing Rectangular 3-Centers. 11th Canadian Conference on Computational Geometry, 1999.

L. Kettner. Using Generic Programming for Designing a Data Structure for Polyhedral Surfaces. Computational Geometry: Theory and Applications 13:65-90, 1999.

G. Neyer. Line Simplification with Restricted Orientations. Algorithms and Data Structures, WADS99, Lecture Notes in Comp. Science Vol. 1663, Springer Verlag, 1999, pages 13-24

G. Neyer. Line Simplification with Restricted Orientations. Technical Report, Department of Computer Science, ETH Zurich, Switzerland, TR 311, December 1998.

S. 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.

S. Raab. Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes. In Proc. 15th ACM symposium on Computational Geometry, 1999, pages 163-172.

S. Schirra. A case study on the cost of geometric computing. Algorithm Engineering and Experimentation, ALENEX99, Lecture Notes in Comp. Science Vol. 1619, Springer Verlag, 1999, pages 156-176.

M. Teillaud. 3d triangulations in CGAL. 15th European Workshop Comput. Geom., 1999.

R. Veltkamp. Generic Geometric Programming in the Computational Geometry Algorithms Library. Computer Graphics Forum, 18:2, 1999.