Volume 10, Issue 2 | Discrete & Computational Geometry

Search all Discrete & Computational Geometry articles

Volume 10, Issue 2

July 1993

Filter by

Volume:

Sort by

Date published:

New to old Old to new

8 articles in this issue

Guest editor's foreword
David Avis
EditorialNotes 01 August 1993 Pages: 111 - 112
On-line steiner trees in the Euclidean plane
Noga Alon
Yossi Azar
OriginalPaper 01 August 1993 Pages: 113 - 121
Computing the volume, counting integral points, and exponential sums
Alexander I. Barvinok
OriginalPaper 01 August 1993 Pages: 123 - 141
How hard is half-space range searching?
Hervé Brönnimann
Bernard Chazelle
János Pach
OriginalPaper 01 August 1993 Pages: 143 - 155
Range searching with efficient hierarchical cuttings
Jiří Matoušek
OriginalPaper 01 August 1993 Pages: 157 - 182
Diameter, width, closest line pair, and parametric searching
Bernard Chazelle
Herbert Edelsbrunner
Micha Sharir
OriginalPaper 01 August 1993 Pages: 183 - 196
An upper bound for conforming Delaunay triangulations
Herbert Edelsbrunner
Tiow Seng Tan
OriginalPaper 01 August 1993 Pages: 197 - 213
On ray shooting in convex polytopes
Jiří Matoušek
Otfried Schwarzkopf
OriginalPaper 01 August 1993 Pages: 215 - 232