default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry, Volume 29
Volume 29, Number 1, September 2004
- Ileana Streinu:
Editorial. 1 - Pawel Gajer, Michael T. Goodrich
, Stephen G. Kobourov:
A multi-dimensional approach to force-directed layouts of large graphs. 3-18 - John Iacono:
Expected asymptotically optimal planar point location. 19-22 - Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena:
When can you fold a map? 23-46 - Yingping Huang, Jinhui Xu, Danny Z. Chen:
Geometric permutations of higher dimensional spheres. 47-60
Volume 29, Number 2, October 2004
- Luc Devroye, Christophe Lemaire, Jean-Michel Moreau:
Expected time analysis for Delaunay point location. 61-89 - Paolo Penna, Paola Vocca:
Proximity drawings in polynomial area and volume. 91-116 - Ulrik Brandes, Sabine Cornelsen, Christian Fieß, Dorothea Wagner:
How to draw the minimum cuts of a planar graph. 117-133 - Oswin Aichholzer, Ferran Hurtado, Marc Noy:
A lower bound on the number of triangulations of planar point sets. 135-145 - Lars Arge, Jan Vahrenhold:
I/O-efficient dynamic planar point location. 147-162
Volume 29, Number 3, November 2004
- Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment. 163-175 - Frédéric Vivien, Nicolas Wicker:
Minimal enclosing parallelepiped in 3D. 177-190 - Seok-Hee Hong, Peter Eades, Jonathan Hillman:
Linkless symmetric drawings of series parallel digraphs. 191-221 - Adrian Dumitrescu:
An approximation algorithm for cutting out convex polygons. 223-231 - Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh:
Approximating geometric bottleneck shortest paths. 233-249 - Marcus Brazil, Benny K. Nielsen, Pawel Winter, Martin Zachariasen:
Rotationally optimal spanning and Steiner trees in uniform orientation metrics. 251-263
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-12-04 01:27 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:
