< previous issue
next issue >
On the difficulty of range searching
Andersson, A.; Swanson, K.
On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
Das, G.; Goodrich, M.T.
The common exterior of convex polygons in the plane
Aronov, B.; Sharir, M.
Optimal, output-sensitive algorithms for constructing planar hulls in parallel
Gupta, N.; Sen, S.
Here are a few pages on the site that we think you may find useful: