default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 2
Volume 2, 1987
- Jeff Kahn:
On Lattices with Möbius Function ±1, 0. 1-8 - Daniel Leven, Micha Sharir:
Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams. 9-31 - Sándor Szabó:
A Reduction of Lattice Tiling bz Translates of a Cubical Cluster. 33-36 - Martin Kolinek:
A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems. 37-48 - Franz Aurenhammer:
A Criterion for the Affine Equivalence of Cell Complexes in Rd and Convex Polyhedra in Rd+1+. 49-64 - Ding-Zhu Du, Frank K. Hwang, J. F. Weng:
Steiner Minimal Trees for Regular Polygons. 65-84 - Christian Buchta:
On Nonnegative Solutions of Random Systems of Linear Inequalities. 85-95 - David Avis, Hossam A. ElGindy:
Triangulating Point Sets in Space. 99-111 - Bernard Chazelle, Herbert Edelsbrunner:
Linear Space Data Structures for Two Types of Range Search. 113-126 - David Haussler, Emo Welzl:
epsilon-Nets and Simplex Range Queries. 127-151 - David M. Mount:
Storing the Subdivision of a Polyhedral Surface. 153-174 - Leonidas J. Guibas, Raimund Seidel:
Computing Convolutions by Reciprocal Search. 175-193 - Kenneth L. Clarkson:
New Applications of random Sampling in Computational Geometry. 195-222 - Rolf Schneider:
Tessellations Generated by Hyperplanes. 223-232 - David W. Barnette:
Generating Closed 2-Cell Embeddings in the Torus and the Projective Plane. 233-247 - Robert E. Jamison:
Direction Trees. 249-254 - Daniel Leven, Micha Sharir:
On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space. 255-270 - Peter Schmitt:
delta-Morphic Sets of Prototiles. 271-295 - Louis J. Billera, Katherine E. Magurn:
Balanced Subdivision and Enumeration in Balanced Spheres. 297-317 - Imre Bárány, Zoltán Füredi:
Computing the Volume is Difficulte. 319-326 - Ryan B. Hayward:
A Low Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem. 327-343 - Michael H. Freedman:
A Power Law for the Distortion of Planar Sets. 345-351 - Gábor Fejes Tóth:
Finite Coverings by Translates of Centrally Symmetric Convex Domains. 353-363 - Chee-Keng Yap:
An O (n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments. 365-393 - G. T. Sallee:
Invertible Relations on Polytopes. 395-399 - Ding-Zhu Du, Frank K. Hwang, G. D. Song, G. Y. Ting:
Steiner Minimal Trees on Sets of Four Points. 401-414
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-04 22:10 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:
