default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry, Volume 2
Volume 2, 1992/1993
- Pankaj K. Agarwal, Jirí Matousek:
Relative Neighborhood Graphs in Three Dimensions. 1-14 - Andranik Mirzaian:
Hamiltonian Triangulations and Circumscribing Polygons of Disjoint Line Segments. 15-30 - Peter W. Shor, Christopher J. Van Wyk:
Detecting and Decomposing Self-overlapping Curves. 31-50 - Masatsugu Urabe, Mamoru Watanabe:
On a Counterexample to a Conjecture of Mirzaian. 51-53 - Olivier Devillers
, Stefan Meiser, Monique Teillaud:
Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time Per Operation. 55-80 - Peter C. Fishburn, James A. Reeds:
Unit Distances Between Vertices of a Convex Polygon. 81-91 - John Hershberger:
Upper Envelope Onion Peeling. 93-110 - John Hershberger:
Minimizing the Sum of Diameters Efficiently. 111-118 - Mark de Berg:
Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra. 119-140 - Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin:
Parallel Fractional Cascading on Hypercube Multiprocessors. 141-167 - Jirí Matousek:
Reporting Points in Halfspaces. 169-186 - Pierluigi Crescenzi, Giuseppe Di Battista, Adolfo Piperno:
A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. 187-200 - Michael E. Hohmeyer, Seth J. Teller:
Stabbing Isothetic Boxes and Rectangles in O(n Log N) Time. 201-207 - Eugene Joseph, Steven Skiena:
Model-based Probing Strategies for Convex Polygons. 209-221 - Matthew J. Katz, Mark H. Overmars, Micha Sharir:
Efficient Hidden Surface Removal for Objects with Small Union Size. 223-234 - Sergey V. Avgustinovich, Sergey Vasil'evich Sevast'janov:
Vector Summation within Minimal Angle. 235-239 - David Avis, Viatcheslav P. Grishukhin:
A Bound on the K-gonality of Facets of the Hypermetric Cone and Related Complexity Problems. 241-254 - Patrice Belleville, Thomas C. Shermer:
Probing Polygons Minimally Is Hard. 255-265 - Michael T. Goodrich:
Constructing the Convex Hull of a Partially Sorted Set of Points. 267-278 - Jirí Matousek:
On Vertical Ray Shooting in Arrangements. 279-285 - Peter W. Sauer:
On the Recognition of Digital Circles in Linear Time. 287-302 - Vangelis Bistiolas, Dimitris Sofotassios, Athanasios K. Tsakalidis:
Computing Rectangle Enclosures. 303-308 - Laxmi P. Gewali, Simeon C. Ntafos:
Covering Grids and Orthogonal Polygons with Periscope Guards. 309-334 - Mordecai J. Golin:
How Many Maxima Can There Be? 335-353
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-11-11 23:05 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:
