default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational 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 - Takeshi Tokuyama
:
Efficient algorithms for the minimum diameter bridge problem. 11-18 - Peter Braß:
On finding maximum-cardinality symmetric subsets. 19-25 - 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 - Hiro Ito:
Sum of edge lengths of a multigraph drawn on a convex polygon. 41-47
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 - Sergei Bespamyatnikh:
An O(nlogn) algorithm for the zoo-keeper's problem. 63-74 - Hamish A. Carr, Jack Snoeyink, Ulrike Axen:
Computing contour trees in all dimensions. 75-94 - Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Planarity-preserving clustering and embedding for large planar graphs. 95-114 - Piotr Indyk, Suresh Venkatasubramanian:
Approximate congruence in nearly linear time. 115-128
Volume 24, Number 3, April 2003
- Rados Radoicic, Géza Tóth:
Monotone paths in line arrangements. 129-134 - Prosenjit Bose, Anil Maheshwari, Pat Morin:
Fast approximations for sums of distances, clustering and the Fermat-Weber problem. 135-146 - Giuseppe Liotta, Henk Meijer:
Voronoi drawings of trees. 147-178 - Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars:
On R-trees with low query complexity. 179-195 - Yoav Gabriely, Elon Rimon:
Competitive on-line coverage of grid environments by a mobile robot. 197-224
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-21 19:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
