![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
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
Volume 16, Number 2, June 2000
- 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
Volume 16, Number 3, July 2000
- 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
Volume 16, Number 4, August 2000
- Alfredo García Olaverri, Marc Noy, Javier Tejel
:
Lower bounds on the number of crossing-free subgraphs of KN. 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
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.