External Links

    Journal: Comput. Geom.

    Volume 16, Issue 4

    211 -- 221Alfredo García Olaverri, Marc Noy, Javier Tejel. Lower bounds on the number of crossing-free subgraphs of K::N::
    223 -- 233Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram. Computing simple paths among obstacles
    235 -- 243Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy. Planar segment visibility graphs
    245 -- 256Timothy M. Chan. Reporting curve segment intersections using restricted predicates

    Volume 16, Issue 3

    157 -- 186Ulrich Betke, Martin Henk. Densest lattice packings of 3-polytopes
    187 -- 210Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi. Protecting critical facets in layered manufacturing

    Volume 16, Issue 2

    95 -- 101Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl. A class of point-sets with few k-sets
    103 -- 127Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Murali, Jeffrey Scott Vitter. Cylindrical static and kinetic binary space partitions
    129 -- 156Jean-François Dufourd, François Puitg. Functional specification and prototyping with oriented combinatorial maps

    Volume 16, Issue 1

    1 -- 2Michael T. Goodrich. Editorial
    3 -- 21Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell. Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
    23 -- 33Sergei Bespamyatnikh, Jack Snoeyink. Queries with segments in Voronoi diagrams
    35 -- 52Jean-Daniel Boissonnat, Jack Snoeyink. Efficient algorithms for line and curve segment intersection using restricted predicates
    53 -- 93Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara. Turn-regularity and optimal area drawings of orthogonal representations
    runs on