Abstract is missing.
- A combinatorial maximum cover approach to 2D translational geometric coveringKaren Daniels, Arti Mathur, Roger Grinde. 2-5
- On the parameterized complexity of the generalized rush hour puzzleHenning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt. 6-9
- Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hardTetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap. 10-13
- Estimation of the necessary number of points in Riemannian VoronoiKensuke Onishi, Jin-ichi Itoh. 19-24
- An Implementation of a linear time algorithm for computing the minimum perimeter triangle enclosing a convex polygonAnna Medvedeva, Asish Mukhopadhyay. 25-28
- Parallel morphing of trees and cyclesTherese C. Biedl, Anna Lubiw, Michael J. Spriggs. 29-34
- The spanning ratios of beta-SkeletonWeizhao Wang, Xiang-Yang Li, Yu Wang, Wen-Zhan Song. 35-38
- Approximating the geometric minimum-diameter spanning treeMichael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink. 39-42
- Partitioning Regular Polygons into Circular Pieces I: Convex PartitionsMirela Damian-Iordache, Joseph O Rourke. 43-46
- Equiprojective PolyhedraMasud Hasan, Anna Lubiw. 47-50
- On the worst-case complexity of the silhouette of a polytopeHelmut Alt, Marc Glisse, Xavier Goaoc. 51-55
- Encoding Quadrilateral MeshesAsish Mukhopadhyay, Quanbin Jing. 60-63
- Linear Binary Space Partitions and the Hierarchy of Object ClassesPetr Tobola, Karel Nechvíle. 64-67
- A Space-Efficient Algorithm for Segment IntersectionEric Y. Chen, Timothy M. Chan. 68-71
- Curves of width one and the river shore problemTimothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper. 73-75
- Triangle GuardingJocelyn Smith, William S. Evans. 76-80
- Computing the Similarity of two MelodiesGreg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, David Rappaport, Godfried T. Toussaint. 81-84
- Molecular graphs of a finite points set: a generalization of the Delaunay triangulationMahmoud Melkemi. 85-88
- Computing Delaunay Triangulation with Imprecise Input DataAli Asghar Khanban, Abbas Edalat. 94-97
- Hinged Dissection of Polygons is HardRobert A. Hearn, Erik D. Demaine, Greg N. Frederickson. 98-102
- Decomposing Polygons Into Diameter Bounded ComponentsChris Worman. 103-106
- On Polyhedra Induced by Point Sets in SpaceFerran Hurtado, Godfried T. Toussaint, Joan Trias. 107-110
- On Coherent Rotation Angles for As-Rigid-As-Possible Shape InterpolationJaeil Choi, Andrzej Szymczak. 111-114
- A Genetic Algorithm for the Minimum Tetrahedralization of a Convex PolyhedronIan Hsieh, Kiat-Choong Chen, Cao An Wang. 115-119
- Sufficiently Fat Polyhedra are Not 2-CastableAlexander Golynski, David Bremner. 120-122
- The Gaussian Centre of a Set of Mobile PointsStephane Durocher, David G. Kirkpatrick. 123-127
- Network Design Subject to Facility LocationLaxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekaran. 128-131
- On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfacesMarina L. Gavrilova, Sergei Bespamyatnikh. 136-139
- On the Number of Pseudo-Triangulations of Certain Point SetsOswin Aichholzer, David Orden, Francisco Santos, Bettina Speckmann. 141-144
- An algorithm for the MaxMin area triangulation of a convex polygonJ. Mark Keil, Tzvetalin S. Vassilev. 145-149
- A Constant Approximation Algorithm for Maximum Weight TriangulationShiyan Hu. 150-154
- Degree Bounds for Constrained Pseudo-TriangulationsOswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth. 155-158
- On the Complexity of Halfspace Volume QueriesErik D. Demaine, Jeff Erickson, Stefan Langerman. 159-160
- Multidimensional Orthogonal Range Search Using TriesLingke Bu, Bradford G. Nickerson. 161-165
- Shortest Paths in Two Intersecting Pencils of LinesDavid Hart. 166-169
- On shortest paths in line arrangementsTelikepalli Kavitha, Kasturi R. Varadarajan. 170-173
- Transversals to line segments in R:::3:::Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides. 174-177