Computational Geometry, Volume 11

Volume 11, Number 1, August 1998

• Matthew Dickerson, Daniel Scharstein: Optimal placement of convex polygons to maximize point containment. 1-16 BibTeX
• Alex Glozman, Klara Kedem, Gregory Shpitalnik: On some geometric selection and optimization problems via sorted matrices. 17-28 BibTeX
• Marek Chrobak, Shin-Ichi Nakano: Minimum-width grid drawings of plane graphs. 29-54 BibTeX

Volume 11, Number 2, October 1998

• Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides: The largest k-ball in a d-dimensional box. 59-67 BibTeX
• Mark de Berg, Hazel Everett, Leonidas J. Guibas: The union of moving polygonal pseudodiscs - Combinatorial bounds and applications. 69-81 BibTeX
• Dan Halperin, Mark H. Overmars: Spheres, molecules, and hidden surface removal. 83-102 BibTeX
• Michael R. Bussieck, Marco E. Lübbecke: The vertex set of a 0/1-polytope is strongly P-enumerable. 103-109 BibTeX
• Iliana Bjorling-Sachs: Edge guards in rectilinear polygons. 111-123 BibTeX

Volume 11, Number 3-4, December 1998

• Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich: Offset-polygon annulus placement problems. 125-141 BibTeX
• Michael Segal, Klara Kedem: Geometric applications of posets. 143-156 BibTeX
• Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen: Dynamic motion planning in low obstacle density environments. 157-173 BibTeX
• John Hershberger, Jack Snoeyink: Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time. 175-185 BibTeX
• Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia: Checking the convexity of polytopes and the planarity of subdivisions. 187-208 BibTeX
• Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri: Label placement by maximum independent set in rectangles. 209-218 BibTeX
• Enrico Puppo: Variable resolution triangulations. 219-238 BibTeX