


default search action
Computational Geometry, Volume 25
Volume 25, Number 1-2, May 2003
- Lutz Kettner, David G. Kirkpatrick, Andrea Mantler, Jack Snoeyink
, Bettina Speckmann
, Fumihiko Takeuchi:
Tight degree bounds for pseudo-triangulations of points. 3-12 - Peter Braß
, Christian Knauer:
On counting point-hyperplane incidences. 13-20 - Prosenjit Bose
, Marc J. van Kreveld, Anil Maheshwari, Pat Morin
, Jason Morrison
:
Translating a regular grid over a point set. 21-34 - Ferran Hurtado, Giuseppe Liotta
, Henk Meijer:
Optimal and suboptimal robust algorithms for proximity graphs. 35-49 - Csaba D. Tóth:
Guarding disjoint triangles and claws in the plane. 51-65 - Jerzy W. Jaromczyk, Miroslaw Kowaluk:
Sets of lines and cutting out polyhedral objects. 67-95 - Lutz Kettner, Jarek Rossignac, Jack Snoeyink
:
The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra. 97-116 - Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell:
An algorithmic study of manufacturing paperclips and other folded structures. 117-138 - Hee-Kap Ahn
, Otfried Cheong
, Chan-Su Shin
:
Building bridges between convex region. 161-170 - Oswin Aichholzer
, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristán
, Michael A. Soss:
Long proteins with unique optimal foldings in the H-P model. 139-159
Volume 25, Number 3, July 2003
- Laurent Balmelli, Thomas M. Liebling, Martin Vetterli
:
Computational analysis of mesh simplification using global error. 171-196 - Mordecai J. Golin
, Hyeon-Suk Na:
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes. 197-231 - Charles R. Collins, Kenneth Stephenson:
A circle packing algorithm. 233-256 - David Rappaport:
The visibility graph of congruent discs is Hamiltonian. 257-265

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.