default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 20
Volume 20, Number 1, 1998
- Fred B. Holt, Victor Klee:
Many Polytopes Meeting the Conjectured Hirsch Bound. 1-17 - Branko Grünbaum:
Realizations of Symmetric Maps by Symmetric Polyhedra. 19-33 - Paul H. Edelman, Victor Reiner
:
Visibility Complexes and the Baues Problem for Triangulations in the Plane. 35-59 - Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad:
Visibility with Multiple Reflections. 61-78 - Lorenzo Sadun:
Some Generalizations of the Pinwheel Tiling. 79-110 - András Bezdek, Károly Bezdek, Robert Connelly:
Finite and Uniform Stability of Sphere Packings. 111-130 - R. Stong:
Mapping Zr into Zs with Maximal Contraction. 131-138
Volume 20, Number 2, 1998
- Nikolai P. Dolbilin, Andreas W. M. Dress, Daniel H. Huson:
Two Finiteness Theorems for Periodic Tilings of d-Dimensional Euclidean Space. 143-153 - David Forge, Jorge L. Ramírez Alfonsín:
Straight Line Arrangements in the Real Projective Plane. 155-161 - Mario Alberto López, Shlomo Reisner:
A Special Case of Mahler's Conjecture. 163-177 - György Csizmadia:
On the Independence Number of Minimum Distance Graphs. 179-187 - Eric Rémila:
Tiling Groups: New Applications in the Triangular Lattice. 189-204 - Joachim H. Rieger:
Notes on the Complexity of Exact View Graph Algorithms for Piecewise Smooth Algebraic Surfaces. 205-229 - Eric K. Babson, Louis J. Billera:
The Geometry of Products of Minors. 231-249 - Dan Ismailescu:
Covering the Plane with Copies of a Convex Disk. 251-263 - Boris Solomyak:
Nonperiodicity Implies Unique Composition for Self-Similar Translationally Finite Tilings. 265-279
Volume 20, Number 3, 1998
- Raimund Seidel:
Guest Editor's Foreword. 285 - Pankaj K. Agarwal, Micha Sharir, Emo Welzl:
The Discrete 2-Center Problem. 287-305 - Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama:
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. 307-331 - David Bremner, Komei Fukuda, Ambros Marzetta:
Primal - Dual Methods for Vertex and Facet Enumeration. 333-357 - Timothy M. Chan:
Approximate Nearest Neighbor Queries Revisited. 359-373 - Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr:
Ramsey-Type Results for Geometric Graphs, II. 375-388 - Jesus Garcia-Lopez, Pedro A. Ramos, Jack Snoeyink:
Fitting a Set of Points by a Circle. 389-402
Volume 20, Number 4, 1998
- Idzhad Kh. Sabitov:
The Volume as a Metric Invariant of Polyhedra. 405-425 - Jirí Matousek:
On Constants for Cuttings in the Plane. 427-448 - Balázs Csikós:
On the Volume of the Union of Balls. 449-461 - David Eppstein:
Geometric Lower Bounds for Parametric Matroid Optimization. 463-476 - Nikolai P. Dolbilin, J. C. Lagarias, Marjorie Senechal:
Multiregular Point Systems. 477-498 - Marshall W. Bern, Amit Sahai:
Pushing Disks Together - The Continuous-Motion Case. 499-514 - Tien-Yien Li, Xiaoshen Wang:
Counterexamples to the Connectivity Conjecture of the Mixed Cells. 515-521 - Olivier Devillers, Franco P. Preparata:
A Probabilistic Analysis of the Power of Arithmetic Filters. 523-547 - Laura Anderson:
Homotopy Groups of the Combinatorial Grassmannian. 549-560 - A. Frank van der Stappen, Mark H. Overmars, Mark de Berg, Jules Vleugels:
Motion Planning in Environments with Low Obstacle Density. 561-587
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 2024-11-07 20:36 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:
