default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry, Volume 6
Volume 6, 1996
- Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. 1-19 - Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer:
Generalized Guarding and Partitioning for Rectilinear Polygons. 21-44 - David Eppstein:
Average Case Analysis of Dynamic Geometric Optimization. 45-68 - Mark de Berg:
Computing Half-plane and Strip Discrepancy of Planar Point Sets. 69-83 - Ömer Egecioglu, Teofilo F. Gonzalez:
A Computationally Intractable Problem on Simplicial Complexes. 85-98 - David G. Kirkpatrick, Stephen K. Wismath:
Determining Bar-representability for Ordered Weighted Graphs. 99-122 - Jean-Daniel Boissonnat, André Cérézo, Olivier Devillers
, Jacqueline Duquesne, Mariette Yvinec:
An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension D. 123-130 - Mark de Berg, Marc J. van Kreveld, Otfried Schwarzkopf, Jack Snoeyink:
Point Location in Zones of K-flats in Arrangements. 131-143 - Anil S. Rao, Kenneth Y. Goldberg:
Computing Grasp Functions. 145-168 - Bengt J. Nilsson, Sven Schuierer:
An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon. 169-194 - Peter Braß:
Erds Distance Problems in Normed Spaces. Comput. Geom. 6: 195-214 (1996) - Leonidas J. Guibas, Mark H. Overmars, Jean-Marc Robert:
The Exact Fitting Problem in Higher Dimensions. 215-230 - Tetsuo Asano, Naoki Katoh:
Variants for the Hough Transform for Line Detection. 231-252 - Jirí Matousek, Otfried Schwarzkopf:
A Deterministic Algorithm for the Three-dimensional Diameter Problem. 253-262 - Leonidas Palios:
Optimal Tetrahedralization of the 3D-region "between" a Convex Polyhedron and a Convex Polygon. 263-276 - Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell:
Generating Random Polygons with Given Vertices. 277-290 - Prosenjit Bose, David Bremner, Godfried T. Toussaint:
All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. 291-302 - Michel Pocchiola, Gert Vegter:
Minimal Tangent Visibility Graphs. 303-314 - Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra:
Queries on Voronoi Diagrams of Moving Points. 315-327 - Jules Vleugels, Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao:
Hunting Voronoi Vertices. 329-354 - Ferran Hurtado, Marc Noy:
Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon. 355-369 - Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. 371-391 - Vasilis Capoyleas:
On the Area of the Intersection of Disks in the Plane. 393-396 - Nectarios Kitsios, Athanasios K. Tsakalidis:
Space Reduction and an Extension for a Hidden Line Elimination Algorithm. 397-404
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.
last updated on 2025-12-05 22:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
