


default search action
Computational Geometry, Volume 1
Volume 1, 1991/1992
- David Avis, Paul Erdös, János Pach:

Distinct Distances Determined By Subsets of a Point Set in Space. 1-11 - Mark de Berg:

On Rectilinear Link Distance. 13-34 - Mark H. Overmars, Micha Sharir:

Merging Visibility Maps. 35-49 - Raimund Seidel:

A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons. 51-64 - Pankaj K. Agarwal, Micha Sharir:

Off-line Dynamic Maintenance of the Width of a Planar Point Set. 65-78 - Mikhail J. Atallah, Danny Z. Chen:

Parallel Rectilinear Shortest Paths with Rectangular Obstacles. 79-113 - Thomas C. Shermer:

Computing Bushy and Thin Triangulations. 115-125 - Jürgen Bokowski

, Jürgen Richter-Gebert
, Werner Schindler:
On the Distribution of Order Types. 127-142 - David Eppstein:

The Farthest Point Delaunay Triangulation Minimizes Angles. 143-148 - Simeon C. Ntafos:

Watchman Routes Under Limited Visibility. 149-170 - David Rappaport:

A Convex Hull Algorithm for Discs, and Applications. 171-187 - Pankaj K. Agarwal, Jirí Matousek, Subhash Suri:

Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. 189-201 - Susanne E. Hambrusch, Hung-Yi Tu:

A Framework for 1-D Compaction with Forbidden Region Avoidance. 203-226 - Remco C. Veltkamp:

The gamma-neighborhood Graph. 227-246 - Mark de Berg, Mark H. Overmars:

Hidden Surface Removal for C-oriented Polyhedra. 247-268 - Dan Halperin, Micha Sharir:

Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom. 269-303 - Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink

:
Counting and Cutting Cycles of Lines and Rods in Space. 305-323 - Rolf Klein:

Walking an Unknown Street with Bounded Detour. 325-351

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














