Discrete & Computational Geometry, Volume 1
Volume 1, 1986
- Richard P. Stanley: Two Poset Polytopes. 9-23
- 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
- L. 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
- H. Groemer: Some Basic Properties of Packing and Covering Constants. 183-193
- J. M. Wills: On polyhedra with Transitivity Properties. 195-199
- 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
- L. 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team