Computational Geometry, Volume 24

Volume 24, Number 1, January 2003

• Joseph O'Rourke: On the development of the intersection of a plane with a polytope. 3-10 BibTeX
• Takeshi Tokuyama: Efficient algorithms for the minimum diameter bridge problem. 11-18 BibTeX
• Peter Braß: On finding maximum-cardinality symmetric subsets. 19-25 BibTeX
• Jin Akiyama, Gisaku Nakamura, Akihiro Nozaki, Ken'ichi Ozawa, Toshinori Sakai: The optimality of a certain purely recursive dissection for a sequentially n-divisible square. 27-39 BibTeX
• Hiro Ito: Sum of edge lengths of a multigraph drawn on a convex polygon. 41-47 BibTeX

Volume 24, Number 2, February 2003

• Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink: Ununfoldable polyhedra with convex faces. 51-62 BibTeX
• Sergei Bespamyatnikh: An O(nlogn) algorithm for the zoo-keeper's problem. 63-74 BibTeX
• Hamish Carr, Jack Snoeyink, Ulrike Axen: Computing contour trees in all dimensions. 75-94 BibTeX
• Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planarity-preserving clustering and embedding for large planar graphs. 95-114 BibTeX
• Piotr Indyk, Suresh Venkatasubramanian: Approximate congruence in nearly linear time. 115-128 BibTeX

Volume 24, Number 3, April 2003

• Rados Radoicic, Géza Tóth: Monotone paths in line arrangements. 129-134 BibTeX
• Prosenjit Bose, Anil Maheshwari, Pat Morin: Fast approximations for sums of distances, clustering and the Fermat-Weber problem. 135-146 BibTeX
• Giuseppe Liotta, Henk Meijer: Voronoi drawings of trees. 147-178 BibTeX
• Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars: On R-trees with low query complexity. 179-195 BibTeX
• Yoav Gabriely, Elon Rimon: Competitive on-line coverage of grid environments by a mobile robot. 197-224 BibTeX