default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 4
Volume 4, 1989
- Neil L. White:
A Nonuniform Matroid Which violates the Isotogy Conecture. 1-2 - Chandrajit L. Bajaj, Ming Li:
Geometric Optimization and Dp - Completeness. 3-13 - Hiroshi Maehara:
Note on Induced Subgraphs of the Unit Distance Graph En. 15-18 - Gábor Fejes Tóth, Peter Gritzmann, Jörg M. Wills:
Finite Sphere Packing and Sphere Covering. 19-40 - Pedro Jussieu de Rezende, D. T. Lee, Ying-Fung Wu:
Rectilinear Shortest Paths in the presence of Rectangular Barriers. 41-53 - Asia Ivic Weiss:
Incidence-Polytopes with Toroidal Cells. 55-73 - Walter Whiteley:
A Matroid on Hypergraphs with Applications in Scene Analysis and Geometry. 75-95 - Beat Jaggi, Peter Mani-Levitska, Bernd Sturmfels, Neil White:
Uniform Oriented Matroids Without the Isotopy Property. 97-100 - Pravin M. Vaidya:
An O(n log n) Algorithm for the All-nearest.Neighbors Problem. 101-115 - Mikhail G. Katz:
Diameter-Extremal Subsets of Spheres. 117-137 - Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas:
The Complexity of Cutting Complexes. 139-181 - Fan R. K. Chung:
Sphere-and-Point Incidence Relations in High Dimensions with Applications to Unit Distances and Furthest-Neighbor Pairs. 183-190 - Helge Tverberg:
Proof of Grünbaum's Conjecture on Common Transversals for Translates. 191-203 - Dietrich Kölzow, Attila Kuba, Aljosa Volcic:
An Algorithm for Reconstructing Convex Bodies form Their Projections. 205-237 - Noga Alon, Meir Katchalski, William R. Pulleyblank:
Cutting Disjoint Disks by Straight Lines. 239-243 - Noga Alon, Meir Katchalski, William R. Pulleyblank:
The Maximum Size of a Convex Polygon in a Restricted Set in the Plane. 245-251 - Imre Bárány, James H. Schmerl, Stuart J. Sidney, Jorge Urrutia:
A Combinatorial Result About Points and Balls in Euclidean Space. 259-262 - Ryan Hayward:
A Note on the Circle Containment Problem. 263-264 - Godfried T. Toussaint:
On Seperating Two Simple Polygons by a Single Translation. 265-278 - Hiroshi Maehara:
Helly-Type Theorems for Spheres. 279-285 - Noga Alon, Paul Erdös:
Disjoint Edges in Geometric Graphs. 287-290 - János Pach, Micha Sharir:
The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis. 291-309 - Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications. 311-336 - Herbert Edelsbrunner:
The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces. 337-343 - Endre Boros
, Zoltán Füredi, Leroy M. Kelly:
On Representing Sylvester- Gallai Designs. 345-348 - Jan Reiterman, Vojtech Rödl, Edita Sinajová:
Embeddings of Graphs in Euclidean Spaces. 349-364 - Ethan D. Bloch:
Complexes Whose Boundaries Cannot Be Pused Around. 365-374 - E. A. Kasimatis:
Dissections of Regular Polygons into Triangles of Equal Areas. 375-381 - Kenneth L. Clarkson, Peter W. Shor:
Application of Random Sampling in Computational Geometry, II. 387-421 - Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk:
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. 423-432 - Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments. 433-466 - Bernard Chazelle, Emo Welzl:
Quasi-Optimal Range Searching in Space of Finite VC-Dimension. 467-489 - Leonidas J. Guibas, Micha Sharir, Shmuel Sifrony:
On the General Motion-Planning Problem with Two Degrees of Freedom. 491-521 - Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
On Arrangement of Jordan Arcs with Three Intersection per Pair. 523-539 - Paul Erdös, László Lovász, Katalin Vesztergombi:
On the Graph of Large Distance. 541-549 - Bernard Chazelle, Leonidas J. Guibas:
Visibility and Intersection Problems in Plane Geometry. 551-581 - Jürgen Bokowski:
A Geometric Realization Without Self-Intersections Does Exist for Dyck's Regular Map. 583-589 - Alok Aggarwal, Leonidas J. Guibas, James B. Saxe, Peter W. Shor:
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon. 591-604 - Nimrod Megiddo:
On the Ball Spanned by Balls. 605-610 - Richard Pollack, Micha Sharir, Günter Rote:
Computing the Geodesic Center of a Simple Polygon. 611-626 - Peter Gritzmann, Marek Lassak:
Estimates for the Minimal Width of Polytopes Inscribed in Convex Bodies. 627-635
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-10-22 02:17 CEST 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:
