Discrete & Computational Geometry
- On levels in arrangements of lines, segments, planes, and triangles, AgaAroCha-DCG-98
- Maintaining the extent of a geometric point set, AgaGuiHer-DCG-01
- The discrete 2-center problem, AgaShaWel-DCG-98
- Surface reconstruction by Voronoi filtering, AmeBer-DCG-99
- Regression depth and center points, AmeBerEpp-DCG-00
- On the number of minimal 1-Steiner trees, AroBerEpp-DCG-94
- Polytopes in arrangements, AroDey-DCG-01
- Approximating minimum-weight triangulations in three dimensions, AroFor-DCG-99
- On the zone of a surface in a hyperplane arrangement, AroSha-DCG-93
- Minimal simplicial dissections and triangulations of convex 3-polytopes, BelBreDeL-DCG-00
- Edge insertion for optimal triangulation, BerEdeEpp-DCG-93
- Multivariate regression depth, BerEpp-DCG-02
- Linear-size nonobtuse triangulation of polygons, BerMitRup-DCG-95
- On levels in arrangements of curves, Cha-DCG-03-levels
- A fully dynamic algorithm for planar width, Cha-DCG-03-width
- Output-sensitive results on convex hulls, extreme points, and related problems, Cha-DCG-96
- Geometric applications of a randomized optimization technique, Cha-DCG-99
- Approximation for minimum triangulations of simplicial convex 3-polytopes, ChiFunWan-DCG-01
- Straightening polygonal arcs and convexifying polygonal cycles, ConDemRot-DCG-03
- Improved bounds for planar $k$-sets and related problems, Dey-DCG-98
- Counting triangle crossings and halving planes, DeyEde-DCG-1994
- Shape dimension and approximation from samples, DeyGieGos-DCG-03
- A large subgraph of the minimum weight triangulation, DicKeiMon-DCG-97
- An upper bound for conforming Delaunay triangulations, EdeTan-DCG-93
- Cutting dense point sets in half, EdeValWel-DCG-97
- A near-linear algorithm for the planar segment-center problem, EfrSha-DCG-96
- Guest editor's forward to special issue for ACM Symp. on Computational Geometry, Epp-DCG-03
- Approximating the minimum weight Steiner triangulation, Epp-DCG-94
- Dynamic Euclidean minimum spanning trees and extrema of binary functions, Epp-DCG-95
- Geometric lower bounds for parametric matroid optimization, Epp-DCG-98
- Iterated nearest neighbors and finding minimal polytopes, EppEri-DCG-94
- Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions, EppEri-DCG-99
- Finding minimum area $k$-gons, EppOveRot-DCG-92
- On nearest neighbor graphs, EppPatYao-DCG-97
- Nice point sets can have nasty Delaunay triangulations, Eri-DCG-03
- On simple polygonalizations with optimal area, Fek-DCG-00
- On the number of arrangements of pseudolines, Fel-DCG-97
- Faster approximation algorithms for the rectilinear Steiner problem, FosKauZel-DCG-97
- Curve reconstruction, the traveling salesman problem, and Menger's theorem on length, Gie-DCG-00
- Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming, GooRam-DCG-97
- Almost tight upper bounds for the single cell and zone problems in three dimensions, HalSha-DCG-95
- Flipping edges in triangulations, HurNoyUrr-DCG-99
- On minimum and maximum spanning trees of linearly moving points, KatIbaIwa-DCG-95
- $K$-levels of concave surfaces, KatTok-DCG-02
- The complexity of hyperplane depth in the plane, LanSte-DCG-03
- Algorithms for ham-sandwich cuts, LoMatSte-DCG-94
- Range searching with efficient hierarchical cuttings, Mat-DCG-93
- On geometric optimization with few violated constraints, Mat-DCG-95
- Optimality of the Delaunay triangulation in $R^d$, Raj-DCG-94
- Depth in an arrangement of hyperplanes, RouHub-DCG-99
- Angular properties of Delaunay diagrams in any dimension, SchSpe-DCG-99
- How to cut pseudo-parabolas into segments, TamTok-DCG-98
- An optimal bound for high-quality conforming triangulations, Tan-DCG-96
- Point sets with many $k$-sets, Tot-DCG-01
