| 1. |
Shin-ichi Nakano Efficient generation of triconnected plane triangulations Computational Geometry, 27 (2004) 109-122 |
| 2. |
Jonathan Richard Shewchuk Delaunay refinement algorithms for triangular mesh generation Computational Geometry, 22 (2002) 21-74 |
| 3. |
Siu-Wing Cheng, Tamal K. Dey and Sheung-Hung Poon Hierarchy of surface models and irreducible triangulations*1 Computational Geometry, 27 (2004) 135-150 |
| 4. |
Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe and Andrzej Lingas A fast algorithm for approximating the detour of a polygonal chain*1 Computational Geometry, 27 (2004) 123-134 |
| 5. |
Alberto Bemporad, Carlo Filippi and Fabio D. Torrisi Inner and outer approximations of polytopes using boxes Computational Geometry, 27 (2004) 151-178 |
| 6. |
Boris Aronov, Robert Schiffenbauer and Micha Sharir On the number of views of translates of a cube and related problems*1 Computational Geometry, 27 (2004) 179-192 |
| 7. |
Laurent Balmelli, Thomas Liebling and Martin Vetterli Computational analysis of mesh simplification using global error Computational Geometry, 25 (2003) 171-196 |
| 8. |
Victor Chepoi, Clementine Fanciullini and Yann Vaxes Median problem in some plane triangulations and quadrangulations Computational Geometry, 27 (2004) 193-210 |
| 9. |
Arjen Sevenster Publisher's note Computational Geometry, 27 (2004) 107 |
| 10. |
Peter Brass and Christian Knauer Testing congruence and symmetry for general 3-dimensional objects Computational Geometry, 27 (2004) 3-11 |
| 11. |
Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger and Li Zhang Kinetic collision detection between two simple polygons Computational Geometry, 27 (2004) 211-235 |
| 12. |
Joachim Gudmundsson, Herman Haverkort, Sang-Min Park, Chan-Su Shin and Alexander Wolff Facility location and the geometric minimum-diameter spanning tree Computational Geometry, 27 (2004) 87-106 |
| 13. |
Ferran Hurtado, Rolf Klein, Elmar Langetepe and Vera Sacristan The weighted farthest color Voronoi diagram on trees and graphs*1 Computational Geometry, 27 (2004) 13-26 |
| 14. |
Jean-Daniel Boissonnat and Frederic Cazals Smooth surface reconstruction via natural neighbour interpolation of distance functions*1 Computational Geometry, 22 (2002) 185-203 |
| 15. |
Charles R. Collins and Kenneth Stephenson A circle packing algorithm Computational Geometry, 25 (2003) 233-256 |
| 16. |
Ho-Lun Cheng and Herbert Edelsbrunner Area, perimeter and derivatives of a skin curve*1 Computational Geometry, 26 (2003) 173-192 |
| 17. |
Joachim Gudmundsson, Mikael Hammar and Marc van Kreveld Higher order Delaunay triangulations*1 Computational Geometry, 23 (2002) 85-98 |
| 18. |
Mark de Berg, Prosenjit Bose, Otfried Cheong and Pat Morin On simplifying dot maps*1 Computational Geometry, 27 (2004) 43-62 |
| 19. |
Nina Amenta, Sunghee Choi and Ravi Krishna Kolluri The power crust, unions of balls, and the medial axis transform*1 Computational Geometry, 19 (2001) 127-153 |
| 20. |
Esther M. Arkin, Sandor P. Fekete and Joseph S. B. Mitchell Approximation algorithms for lawn mowing and milling* Computational Geometry, 17 (2000) 25-50 |
| 21. |
David Eppstein, John M. Sullivan and Alper Ungor Tiling space and slabs with acute tetrahedra Computational Geometry, 27 (2004) 237-255 |
| 22. |
Jean-Daniel Boissonnat and Frederic Cazals Natural neighbor coordinates of points on a surface*1 Computational Geometry, 19 (2001) 155-173 |
| 23. |
Mordecai J. Golin and Hyeon-Suk Na On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes Computational Geometry, 25 (2003) 197-231 |
| 24. |
Erik D. Demaine, Martin L. Demaine, Michael Hoffmann and Joseph O'Rourke Pushing blocks is hard Computational Geometry, 26 (2003) 21-36 |
| 25. |
Jerzy W. Jaromczyk and Miroslaw Kowaluk Computational Geometry, 27 (2004) 1 |