Computational Geometry, Volume 16

Volume 16, Number 1, May 2000

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

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

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

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