Table of Contents

• Parametric search made practicalRené van Oostrum, Remco C. Veltkamp. 1-9 [doi]
• A local search approximation algorithm for k-means clusteringTapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu. 10-18 [doi]
• On the crossing number of complete graphsOswin Aichholzer, Franz Aurenhammer, Hannes Krasser. 19-24 [doi]
• On the number of embeddings of minimally rigid graphsCiprian Borcea, Ileana Streinu. 25-32 [doi]
• Collision detection for deforming necklacesLeonidas J. Guibas, An Nguyen, Daniel Russel, Li Zhang. 33-42 [doi]
• Efficient maintenance and self-collision testing for Kinematic ChainsItay Lotan, Fabian Schwarzer, Dan Halperin, Jean-Claude Latombe. 43-52 [doi]
• Box-trees for collision checking in industrial installationsHerman J. Haverkort, Mark de Berg, Joachim Gudmundsson. 53-62 [doi]
• Finite metric spaces: combinatorics, geometry and algorithmsNathan Linial. 63 [doi]
• Finding the consensus shape for a protein familyL. Paul Chew, Klara Kedem. 64-73 [doi]
• Paper position sensingMarshall W. Bern, David Goldberg. 74-81 [doi]
• A global approach to automatic solution of jigsaw puzzlesDavid Goldberg, Christopher Malon, Marshall W. Bern. 82-87 [doi]
• The power of nonmonotonicity in geometric searchingBernard Chazelle. 88-93 [doi]
• A lower bound on the distortion of embedding planar metrics into Euclidean spaceIlan Newman, Yuri Rabinovich. 94-96 [doi]
• The one-round Voronoi gameOtfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek. 97-101 [doi]
• Approximate nearest neighbor algorithms for Frechet distance via product metricsPiotr Indyk. 102-106 [doi]
• Point-line incidences in spaceMicha Sharir, Emo Welzl. 107-115 [doi]
• Incidences between points and circles in three and higher dimensionsBoris Aronov, Vladlen Koltun, Micha Sharir. 116-122 [doi]
• Lenses in arrangements of pseudo-circles and their applicationsEran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky. 123-132 [doi]
• Pseudotriangulations, polytopes, and how to expand linkagesGünter Rote. 133-134 [doi]
• Guaranteed: quality parallel delaunay refinement for restricted polyhedral domainsDémian Nave, Nikos Chrisochoides, L. Paul Chew. 135-144 [doi]
• The Delaunay tetrahedralization from Delaunay triangulated surfaces Sunghee ChoiSunghee Choi. 145-150 [doi]
• Quickest paths, straight skeletons, and the city Voronoi diagramOswin Aichholzer, Franz Aurenhammer, Belén Palop. 151-159 [doi]
• Testing Homotopy for paths in the planeSergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink. 160-169 [doi]
• Pseudo approximation algorithms, with applications to optimal motion planningTetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap. 170-178 [doi]
• Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygonsDavid G. Kirkpatrick, Bettina Speckmann. 179-188 [doi]
• Interlocked open linkages with few jointsErik D. Demaine, Stefan Langerman, Joseph O Rourke, Jack Snoeyink. 189-198 [doi]
• Conforming Delaunay triangulations in 3DDavid Cohen-Steiner, Éric Colin de Verdière, Mariette Yvinec. 199-208 [doi]
• The probabilistic complexity of the Voronoi diagram of points on a polyhedronMordecai J. Golin, Hyeon-Suk Na. 209-216 [doi]
• Vertex-unfoldings of simplicial manifoldsErik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O Rourke. 237-243 [doi]
• Optimally cutting a surface into a diskJeff Erickson, Sariel Har-Peled. 244-253 [doi]
• Optimal decomposition of polygonal models into triangle stripsRegina Estkowski, Joseph S. B. Mitchell, Xinyu Xiang. 254-263 [doi]
• Hybrid meshes: multiresolution using regular and irregular refinementIgor Guskov, Andrei Khodakovsky, Peter Schröder, Wim Sweldens. 264-272 [doi]
• Exact minkowski sums and applicationsEyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz. 273-274 [doi]
• Growing fat graphsAlon Efrat, Stephen G. Kobourov, Michael Stepp, Carola Wenk. 277-278 [doi]
• AUTO-FOLLOW: getting a piece of the action all the timeAlexander Bogomjakov, Craig Gotsman. 279-280 [doi]
• Adventures of Möbius band: mathematical visualization in virtual environmentStanislav V. Klimenko, Gregory M. Nielson, Lialia Nikitina, Igor N. Nikitin. 281-282 [doi]
• Improved construction of vertical decompositions of three-dimensional arrangementsHayim Shaul, Dan Halperin. 283-292 [doi]
• Cost prediction for ray shootingBoris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang. 293-302 [doi]
• Visibility preserving terrain simplification: an experimental studyBoaz Ben-Moshe, Joseph S. B. Mitchell, Matthew J. Katz, Yuval Nir. 303-311 [doi]
• Projective clustering in high dimensions using core-setsSariel Har-Peled, Kasturi R. Varadarajan. 312-318 [doi]