External Links

    Journal: Comput. Geom.

    Volume 29, Issue 3

    163 -- 175Partha 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
    177 -- 190Frédéric Vivien, Nicolas Wicker. Minimal enclosing parallelepiped in 3D
    191 -- 221Seok-Hee Hong, Peter Eades, Jonathan Hillman. Linkless symmetric drawings of series parallel digraphs
    223 -- 231Adrian Dumitrescu. An approximation algorithm for cutting out convex polygons
    233 -- 249Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh. Approximating geometric bottleneck shortest paths
    251 -- 263Marcus Brazil, Benny K. Nielsen, Pawel Winter, Martin Zachariasen. Rotationally optimal spanning and Steiner trees in uniform orientation metrics

    Volume 29, Issue 2

    61 -- 89Luc Devroye, Christophe Lemaire, Jean-Michel Moreau. Expected time analysis for Delaunay point location
    91 -- 116Paolo Penna, Paola Vocca. Proximity drawings in polynomial area and volume
    117 -- 133Ulrik Brandes, Sabine Cornelsen, Christian Fieß, Dorothea Wagner. How to draw the minimum cuts of a planar graph
    135 -- 145Oswin Aichholzer, Ferran Hurtado, Marc Noy. A lower bound on the number of triangulations of planar point sets
    147 -- 162Lars Arge, Jan Vahrenhold. I/O-efficient dynamic planar point location

    Volume 29, Issue 1

    1 -- 0Ileana Streinu. Editorial
    3 -- 18Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov. A multi-dimensional approach to force-directed layouts of large graphs
    19 -- 22John Iacono. Expected asymptotically optimal planar point location
    23 -- 46Esther 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?
    47 -- 60Yingping Huang, Jinhui Xu, Danny Z. Chen. Geometric permutations of higher dimensional spheres
    runs on