Volume 26, Issue 2 | Discrete & Computational Geometry

Search all Discrete & Computational Geometry articles

Volume 26, Issue 2

January 2001

Filter by

Volume:

Sort by

Date published:

New to old Old to new

7 articles in this issue

Guest Editor’s Foreword
Pankaj K. Agarwal
EditorialNotes 01 January 2001 Pages: 185 - 186
Point Sets with Many k-Sets
G. Tóth
OriginalPaper 01 January 2001 Pages: 187 - 194
An Improved Bound for k-Sets in Three Dimensions
M. Sharir
S. Smorodinsky
G. Tardos
OriginalPaper 01 January 2001 Pages: 195 - 204
A Continuous Analogue of the Upper Bound Theorem
U. Wagner
E. Welzl
OriginalPaper 01 January 2001 Pages: 205 - 219
A Trace Bound for the Hereditary Discrepancy
B. Chazelle
A. Lvov
OriginalPaper 01 January 2001 Pages: 221 - 231
An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
E. A. Ramos
OriginalPaper 01 January 2001 Pages: 233 - 244
A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
N. M. Amato
M. T. Goodrich
E. A. Ramos
OriginalPaper 01 January 2001 Pages: 245 - 265