13. CCCG 2001: Waterloo, Ontario, Canada

• Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
  The cccg 2001 logo.
  
• George W. Hart:
  Rapid prototyping of geometric models. 1-4
  
• Mike Lazaridis:
  Opportunities for mathematicians in industry government research.
  
• N. J. A. Sloane:
  Plane packing.
  
• Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink:
  The reflex-free hull. 9-12
  
• Oswin Aichholzer, Ferran Hurtado, Marc Noy:
  On the number of triangulations every planar point set must have. 13-16
  
• Oswin Aichholzer, Hannes Krasser:
  The point set order type data base: A collection of applications and results. 17-20
  
• Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint:
  Algorithms for bivariate medians and a fermat-torricelli problem for lines. 21-24
  
• Diogo Vieira Andrade, Luiz Henrique de Figueiredo:
  Good approximations for the relative neighbourhood graph. 25-28
  
• Francois Anton, Darka Mioc, Christopher M. Gold:
  Line voronoi diagram based interpolation and application to digital terrain modelling. 29-32
  
• Laurent Balmelli, Thomas M. Liebling, Martin Vetterli:
  Computational analysis of 4-8 meshes with application to surface simplification using global error. 33-36
  
• Ralph P. Boland, Jorge Urrutia:
  A simpler circular ray shooting algorithm. 37-40
  
• Ralph P. Boland, Jorge Urrutia:
  Finding the largest axis aligned rectangle in a polygon in o(n log n) time. 41-44
  
• Björn Brodén, Mikael Hammar, Bengt J. Nilsson:
  Guarding lines and 2-link polygons is apx-hard. 45-48
  
• Suzanne F. Buchele, Angela C. Roles:
  Binary space partitioning tree and constructive solid geometry representations for objects bounded by curved surfaces. 49-52
  
• Andrew Y. Cheng, Ming Ouyang:
  On algorithms for simplicial depth. 53-56
  
• Éric Colin de Verdière, Michel Pocchiola, Gert Vegter:
  Tutte's barycenter method applied to isotopies. 57-60
  
• Karen Daniels, Rajasekhar Inkulu:
  Translational polygon covering using intersection graphs. 61-64
  
• Erik D. Demaine, Michael Hoffmann:
  Pushing blocks is np-complete for noncrossing solution paths. 65-68
  
• Erik D. Demaine, Stefan Langerman, Joseph O'Rourke:
  Short interlocked linkages. 69-72
  
• Erik D. Demaine, Joseph S. B. Mitchell:
  Reaching folded states of a rectangular piece of paper. 73-75
  
• Olivier Devillers, Philippe Guigue:
  The shuffling buffer. 77-80
  
• Olivier Devillers, Ferran Hurtado, Mercè Mora, Carlos Seara:
  Separating several point sets in the plane. 81-84
  
• Tamal K. Dey, Joachim Giesen, James Hudson:
  Decimating samples for mesh simplification. 85-88
  
• Matthew Dickerson, Michael T. Goodrich:
  Matching points to a convex polygonal boundary. 89-92
  
• Abbas Edalat, André Lieutier, Elham Kashefi:
  The convex hull in a new model of computation. 93-96
  
• Lukas Finschi, Komei Fukuda:
  Complete combinatorial generation of small point configurations and hyperplane arrangements. 97-100
  
• Bernd Gärtner, Thomas Herrmann:
  Computing the width of a point set in 3-space. 101-103
  
• David Hart:
  Approximating the shortest path in line arrangements. 105-108
  
• Michael Hoffmann, Csaba D. Tóth:
  Segment endpoint visibility graphs are hamiltonian. 109-112
  
• Jerzy W. Jaromczyk, Yang Wang:
  Local optimization of triangular surface meshes for general quadrics in lp norm. 113-116
  
• Lutz Kettner, David G. Kirkpatrick, Bettina Speckmann:
  Tight degree bounds for pseudo-triangulations of points. 117-120
  
• Zhangjian Li, Shin-Ichi Nakano:
  Listing all connected plane triangulation. 121-124
  
• Alejandro López-Ortiz, Graeme Sweet:
  Parallel searching on a lattice. 125-128
  
• Andrea Mantler, Jack Snoeyink:
  Heaphull?. 129-131
  
• Joseph O'Rourke, Irena Pashchenko, Geetika Tewari:
  Partitioning orthogonal polygons into fat rectangles. 133-136
  
• Joseph O'Rourke, Octavia Petrovici:
  Narrowing light rays with mirrors. 137-140
  
• Valerio Pascucci:
  On the topology of the level sets of a scalar field. 141-144
  
• Axel Pavillet:
  Voronoï diagrams in projective geometry and sweep circle algorithms for constructing circle-based voronoï diagrams. 145-148
  
• Dana Randall, Günter Rote, Francisco Santos, Jack Snoeyink:
  Counting triangulations and pseudo-triangulations of wheels. 149-152
  
• Ian Sanders, Leigh-Ann Kenny:
  Heuristics for placing non-orthogonal axial lines to cross the adjacencies between orthogonal rectangles. 153-156
  
• Chang Shu, Michael A. Greenspan, Guy Godin:
  Nearest neighbor search through function minimization. 157-160
  
• Jack Snoeyink:
  The arithmetic precision of ray-polygon intersection testing. 161-164
  
• Falk Tschirschnitz:
  Testing extendability for partial chirotopes is np-complete. 165-168
  
• Alper Üngör:
  Tiling 3d euclidean space with acute tetrahedra. 169-172
  
• Chee Yap, Yunyue Zhu:
  Yet another look at fractional cascading: B-graphs with application to point location. 173-176
  
• Yunhong Zhou, Subhash Suri:
  Geometric permutations of balls with bounded size disparity. 177-180
  
• Martin Ziegler, Vasco Brattka:
  Turing computability of (non-)linear optimization. 181-184
  
• Erik D. Demaine, Joseph O'Rourke:
  Open problems from cccg 2000. 185-187