default search action
Computational Geometry, Volume 38
Volume 38, Numbers 1-2, September 2007
- Bernd Gärtner, Remco C. Veltkamp:
A decade of CGAL. 1-3 - Deepak Bandyopadhyay, Jack Snoeyink:
Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL. 4-15 - Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel:
An adaptable and extensible geometry kernel. 16-36 - Ron Wein, Efi Fogel, Baruch Zukerman, Dan Halperin:
Advanced programming techniques applied to Cgal's arrangement package. 37-63 - Peter Hachenberger, Lutz Kettner, Kurt Mehlhorn:
Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments. 64-99 - Laurent Rineau, Mariette Yvinec:
A generic software design for Delaunay refinement meshing. 100-110 - Daniel Russel, Menelaos I. Karavelas, Leonidas J. Guibas:
A package for exact kinetic data structures and sweepline algorithms. 111-127
Volume 38, Number 3, October 2007
- Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt, Li Zhang:
On incremental rendering of silhouette maps of a polyhedral scene. 129-138 - Joachim Gudmundsson, Christos Levcopoulos:
Minimum weight pseudo-triangulations. 139-153 - Sergey Bereg, José Miguel Díaz-Báñez, Carlos Seara, Inmaculada Ventura:
On finding widest empty curved corridors. 154-169 - Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos:
Maximizing the guarded boundary of an Art Gallery is APX-complete. 170-180 - Vida Dujmovic, Matthew Suderman, David R. Wood:
Graph drawings with few slopes. 181-193 - Vida Dujmovic, David Eppstein, Matthew Suderman, David R. Wood:
Drawings of planar graphs with few slopes and segments. 194-212 - Jan Vahrenhold:
Line-segment intersection made in-place. 213-230
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.