Proceedings of the Seventeenth Annual Symposium on Computational Geometry, June 3-5, 2001, Medford, MA, USA. ACM, 2001

• 
  Pankaj K. Agarwal, Micha Sharir: On the number of congruent simplices in a point. 1-9
• 
  Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser: Enumerating order types for small sets with applications. 11-18
• 
  János Pach, Ido Safruti, Micha Sharir: The union of congruent cubes in three dimensions. 19-28
• 
  József Solymosi, Csaba D. Tóth: On the distinct distances determined by a planar point set. 29-32
• 
  Sergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, Tycho Strijk: Schematization of road networks. 33-39
• 
  Regina Estkowski, Joseph S. B. Mitchell: Simplifying a polygonal subdivision while keeping it simple. 40-49
• 
  Nabil H. Mustafa, Eleftherios Koutsofios, Shankar Krishnan, Suresh Venkatasubramanian: Hardware-assisted view-dependent map simplification. 50-59
• 
  Mihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar: Efficient perspective-accurate silhouette computation and applications. 60-68
• 
  Thomas C. Hales: Sphere packings and generative. 69
• 
  Herbert Edelsbrunner, John Harer, Afra Zomorodian: Hierarchical morse complexes for piecewise linear 2-manifolds. 70-79
• 
  Francis Lazarus, Michel Pocchiola, Gert Vegter, Anne Verroust: Computing a canonical polygonal schema of an orientable triangulated surface. 80-89
• 
  Alan Saalfeld: Area-preserving piecewise affine mappings. 90-95
• 
  Jeff Erickson: Nice point sets can have nasty Delaunay triangulations. 96-105
• 
  Olivier Devillers, Sylvain Pion, Monique Teillaud: Walking in a triangulation. 106-114
• 
  Herbert Edelsbrunner, Damrong Guoy: Sink-insertion for mesh improvement. 115-123
• 
  Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort: Box-trees and R-trees with near-optimal query time. 124-133
• 
  Mark de Berg, João Comba, Leonidas J. Guibas: A segment-tree based kinetic BSP. 134-140
• 
  Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir: Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. 141-150
• 
  Csaba D. Tóth: A note on binary plane partitions. 151-156
• 
  Helmut Alt, Laura Heinrich-Litan: Exact L_infty Nearest Neighbor Search in High Dimensions. 157-163
• 
  Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell: Farthest neighbors and center points in the presence of rectangular obstacles. 164-171
• 
  Timothy M. Chan: A fully dynamic algorithm for planar. 172-176
• 
  Sariel Har-Peled: A practical approach for computing the diameter of a point set. 177-186
• 
  Frederic M. Richards: Protein geometry as a function of time. 187
• 
  Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu: Discrete mobile centers. 188-196
• 
  Vladlen Koltun: Segment intersection searching problems in general settings. 197-206
• 
  Stefan Langerman: On the complexity of halfspace area queries. 207-211
• 
  Danny Z. Chen, Xiaobo Hu, Yingping Huang, Yifan Li, Jinhui Xu: Algorithms for congruent sphere packing and applications. 212-221
• 
  Ewgenij Gawrilow, Michael Joswig: Polymake: an approach to modular software design in computational geometry. 222-231
• 
  Héctor H. González-Baños: A randomized art-gallery algorithm for sensor placement. 232-240
• 
  Naoki Katoh, Takeshi Tokuyama: Notes on computing peaks in k-levels and parametric spanning trees. 241-248
• 
  Matthew J. Katz, Kasturi R. Varadarajan: A tight bound on the number of geometric permutations of convex fat objects in R^d. 249-251
• 
  Micha Sharir: The Clarkson-Shor technique revisited and extended. 252-256
• 
  Tamal K. Dey, Joachim Giesen: Detecting undersampling in surface reconstruction. 257-263
• 
  Nicola Geismann, Michael Hemmer, Elmar Schömer: Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually! 264-273
• 
  Shankar Krishnan, Mark Foskey, Tim Culver, John Keyser, Dinesh Manocha: PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation. 274-283
• 
  George W. Hart: Computational geometry for sculpture. 284-287
• 
  Saugata Basu: Different bounds on the different Betti numbers of semi-algebraic sets. 288-292
• 
  David P. Dobkin, Ayellet Tal: Efficient and small representation of line arrangements with applications. 293-301
• 
  Pierre Angelier, Michel Pocchiola: A sum of squares theorem for visibility. 302-311
• 
  Rados Radoicic, Géza Tóth: Monotone paths in line arrangement. 312-314
• 
  Micha Sharir, Emo Welzl: Balanced lines, halving triangles, and the generalized lower bound theorem. 315-318
• 
  David P. Dobkin, Ayellet Tal: Small representation of line arrangements. 319-320
• 
  Nicola Geismann, Michael Hemmer, Elmar Schömer: The convex hull of ellipsoids. 321-322
• 
  Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin: 2-point site Voronoi diagrams. 323-324
• 
  Martin Isenburg, Stefan Gumhold, Craig Gotsman: The connectivity shapes video. 325-326
• 
  Lutz Kettner, Jack Snoeyink: A prototype system for visualizing time-dependent volume data. 327-328