default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 1
Volume 1, 1986
- Noga Alon, Daniel J. Kleitman:
Covering a Square by Small Perimeter Rectangles. 1-7 - Richard P. Stanley:
Two Poset Polytopes. 9-23 - Herbert Edelsbrunner, Raimund Seidel:
Voronoi Diagrams and Arrangements. 25-44 - H. E. Debrunner, Peter Mani-Levitska:
Can You Cover Your Shadows?. 45-58 - Klara Kedem, Ron Livne, János Pach, Micha Sharir:
On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles. 59-70 - János Pach:
Covering the Plane with Convex Polygons. 73-81 - Bernard Chazelle, Franco P. Preparata:
Halfspace Range Search: An Algorithmic Application of k-Sets. 83-93 - Emo Welzl:
More on k-Sets of Finite Sets in the Plane. 95-100 - Leroy M. Kelly:
A Resolution of the Sylvester - Gallai Problem of J. -P. Serre. 101-104 - Günter Ewald:
Spherical Complexes and Nonprojective Toric Varieties. 115-122 - John D. Hobby:
Smooth, Easy to Computer Interpolating Splines. 123-140 - Egon Schulte, Jörg M. Wills:
Geometric Realizations for Dyck's Regular Map on a Surface of Genus 3. 141-153 - Jyun-Sheng Chang, Chee-Keng Yap:
A Polynomial Solution for the Potato-peeling Problem. 155-182 - H. Groemer:
Some Basic Properties of Packing and Covering Constants. 183-193 - Jörg M. Wills:
On polyhedra with Transitivity Properties. 195-199 - D. T. Lee, A. K. Lin:
Generalized Dalaunay Triangualtion for Planar Graphs. 201-217 - Jacob E. Goodman, Richard Pollack:
Upper Bounds for Configurations and Polytopes in Rd. 219-227 - Alan J. Hoffman, Carl W. Lee:
On the Cone of Nonnegative Circuits. 229-239 - A. Florian:
Approximation of Convex Discs by Polygons. 241-263 - David Avis:
diameter Partitioning. 265-276 - Raul Cordovil, Rui Dilão
, Ana Noronha da Costa:
Periodic Orbits for Additive Cellular Automata. 277-288 - György Elekes:
A Geometric Inequality and the Complexity of Computing Volume. 289-292 - Jürgen Bokowski, Bernd Sturmfels:
On the Coordinatization of Oriented Matroids. 293-306 - László Fejes Tóth:
Densest Packing of Translates of the Union of Two Circles. 307-314 - Zoltán Füredi:
Random Polytopes in the d-Dimensional Cube. 315-319 - Roberto Tamassia, Ioannis G. Tollis:
A Unified Approach a Visibility Representation of Planar Graphs. 321-341 - Pierre Rosenstiehl, Robert Endre Tarjan:
Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs. 343-353 - Amos Altshuler, Ulrich Brehm:
The Weakly Neighborly Polyhedral Maps on the 2-Manifold with Euler Characteristic - 1. 355-369 - Meir Katchalski, Ted Lewis, Andrew Chiang-Fung Liu:
Geometric Permutations and Common Transversals. 371-377 - Michel Deza, Peter Frankl:
On Squashed Designs. 379-390
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-26 08:00 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:
