Computational Geometry

Most requested articles January - August 2004

1. Jonathan Richard Shewchuk
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry, 22 (2002) 21-74
2. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman and Angela Y. Wu
A local search approximation algorithm for k-means clustering
Computational Geometry, 28 (2004) 89-112
3. David Cohen-Steiner, Eric Colin de Verdiere and Mariette Yvinec
Conforming Delaunay triangulations in 3D
Computational Geometry, 28 (2004) 217-233
4. Shin-ichi Nakano
Efficient generation of triconnected plane triangulations
Computational Geometry, 27 (2004) 109-122
5. 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
6. Alberto Bemporad, Carlo Filippi and Fabio D. Torrisi
Inner and outer approximations of polytopes using boxes
Computational Geometry, 27 (2004) 151-178
7. Victor Chepoi, Clementine Fanciullini and Yann Vaxes
Median problem in some plane triangulations and quadrangulations
Computational Geometry, 27 (2004) 193-210
8. Rene van Oostrum and Remco C. Veltkamp
Parametric search made practical
Computational Geometry, 28 (2004) 75-88
9. 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
10. Laurent Balmelli, Thomas Liebling and Martin Vetterli
Computational analysis of mesh simplification using global error
Computational Geometry, 25 (2003) 171-196
11. Siu-Wing Cheng, Tamal K. Dey and Sheung-Hung Poon
Hierarchy of surface models and irreducible triangulations*1
Computational Geometry, 27 (2004) 135-150
12. Peter Brass and Christian Knauer
Testing congruence and symmetry for general 3-dimensional objects
Computational Geometry, 27 (2004) 3-11
13. 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
14. 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
15. Joachim Gudmundsson, Mikael Hammar and Marc van Kreveld
Higher order Delaunay triangulations*1
Computational Geometry, 23 (2002) 85-98
16. David Eppstein, John M. Sullivan and Alper Ungor
Tiling space and slabs with acute tetrahedra
Computational Geometry, 27 (2004) 237-255
17. Charles R. Collins and Kenneth Stephenson
A circle packing algorithm
Computational Geometry, 25 (2003) 233-256
18. Benjamin Marlin and Godfried Toussaint
Constructing convex 3-polytopes from two triangulations of a polygon
Computational Geometry, 28 (2004) 41-47
19. 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
20. Erik D. Demaine, John Iacono and Stefan Langerman
Proximate point searching
Computational Geometry, 28 (2004) 29-40
21. Jean-Daniel Boissonnat and Frederic Cazals
Smooth surface reconstruction via natural neighbour interpolation of distance functions*1
Computational Geometry, 22 (2002) 185-203
22. Jean-Daniel Boissonnat and Frederic Cazals
Natural neighbor coordinates of points on a surface*1
Computational Geometry, 19 (2001) 155-173
23. Herman J. Haverkort, Mark de Berg and Joachim Gudmundsson
Box-trees for collision checking in industrial installations
Computational Geometry, 28 (2004) 113-135
24. Ho-Lun Cheng and Herbert Edelsbrunner
Area, perimeter and derivatives of a skin curve*1
Computational Geometry, 26 (2003) 173-192
25. Mark de Berg, Prosenjit Bose, Otfried Cheong and Pat Morin
On simplifying dot maps*1
Computational Geometry, 27 (2004) 43-62
26. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser and Bettina Speckmann
Convexity minimizes pseudo-triangulations
Computational Geometry, 28 (2004) 3-10