Table of Contents

• Folding Rulers inside TrianglesMarc J. van Kreveld, Jack Snoeyink, Sue Whitesides. 1-6
• The Complexity of the Compaction ProblemZhenyu Li, Victor Milenkovic. 7-11
• On the Complexity of Assembly PartitioningLydia E. Kavraki, Jean-Claude Latombe, Randall H. Wilson. 12-17
• Tetrahedralization of Simple and Non-Simple PolyhedraGodfried T. Toussaint, Clark Verbrugge, Cao An Wang, Binhai Zhu. 24-29
• A Discussion on the Triangulation Refinement ProblemMaria-Cecilia Rivara. 42-47
• Algorithms for Ham Sandwich CutsWilliam L. Steiger. 48-48
• On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 DimensionsMichael B. Dillencourt, David M. Mount, Alan Saalfeld. 49-54
• Geometric Orderings and Helly-type Theorem for Intersecting Translates in the PlaneJean-Marc Robert. 61-66
• An Experiment Using LN for Exact Geometric ComputationsJacqueline D. Chang, Victor Milenkovic. 67-78
• Efficient Algorithms for Robust Circular Arc EstimatorsDavid M. Mount, Nathan S. Netanyahu. 79-84
• Guarding a TreasurySvante Carlsson, Håkan Jonsson. 85-90
• Shortest Watchman Tours in Weak Visibility PolygonsP. Pradeep Kumar, C. E. Veni Madhavan. 91-96
• The Minimum Cooperative Guards Problem on K-spiral PolygonsBern-Cherng Liaw, N. F. Huang, Richard C. T. Lee. 97-102
• The Edge Guard Problem for Spiral PolygonsShivakumar Viswanathan. 103-108
• Perfect Binary Space PartitionsMark de Berg, Marko de Groot, Mark H. Overmars. 109-114
• On the Union of Fat Wedges and Separating a Collection of Segments By a LineAlon Efrat, Günter Rote, Micha Sharir. 115-120
• On Vertical Decomposition of Arrangements of Hyperplanes in Four DimensionsLeonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir. 127-132
• Randomizing Optimal Geometric AlgorithmsLarry Shafer, William L. Steiger. 133-138
• Optimal Slope Selection Via ExpandersMatthew J. Katz, Micha Sharir. 139-144
• Lower Bounds for the Complexity of the Hausdorff DistanceWilliam Rucklidge. 145-150
• Geometric Pattern Matching Under Euclidean MotionL. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets. 151-156
• Topological Characterization of Hwang s Optimal Steiner TreesJocelyn Cloutier, Imed Bennour. 157-162
• Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic TimeDavid G. Kirkpatrick, Jack Snoeyink. 163-168
• Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line SegmentsAsish Mukhopadhyay, Chanchal Kumar, Binay K. Bhattacharya. 169-174
• GeoLab: An Environment for Development of Algorithms in Computational GeometryPedro Jussieu de Rezende, Welson R. Jacometti. 175-180
• Arrangements of Surfaces in Higher Dimensions: Envelopes Single Cells and Other Recent DevelopmentsMicha Sharir. 181-186
• Dominance Drawings of Bipartite GraphsHossam A. ElGindy, Michael E. Houle, William Lenhart, Mirka Miller, David Rappaport, Sue Whitesides. 187-191
• Area Requirement of Visibility Representations of TreesGoos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis. 192-197
• On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm for a Convex Polygon in the PlaneKlara Kedem, Micha Sharir, Sivan Toledo. 204-209
• On Parallel Rectilinear Obstacle-avoiding PathsMikhail J. Atallah, Danny Z. Chen. 210-215
• Shortest Paths for a Two-robot Rendez-vousErik L. Wynters, Joseph S. B. Mitchell. 216-221
• On Minimum and Maximum Visibility ProblemLaxmi Gewali. 240-245
• Simple Randomized Algorithms for Closest Pair ProblemsMordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid. 246-251
• A Simple Algorithm for Maintaining the Center of a Planar Point-setReuven Bar-Yehuda, Alon Efrat, Alon Itai. 252-257
• Maintaining the Approximate Width of a Set of Points in the PlaneGünter Rote, Christian Schwarz, Jack Snoeyink. 258-263
• Semi-dynamic Closest-pair AlgorithmsYossi Matias. 264-271
• Teaching Computational GeometryRaimund Seidel. 272-272
• Optimal Algorithms to Detect Null-homologous Cycles on 2-manifoldsTamal K. Dey. 273-278
• Acyclic Hierarchical Cell ComplexesMichela Bertolotto, Elisabetta Bruzzone, Leila De Floriani. 279-284
• On the Minimal Number of Volume Intersection Operations Necessary for Reconstructing a 3D ObjectAldo Laurentini. 285-290
• An Output Sensitive Algorithm for the Computation of Shadow BoundariesA. James Stewart, Sherif Ghali. 291-296
• Dent and Staircase VisibilityDerick Wood, Peter Yamamoto. 297-302
• LR-visibility in PolygonsGautam Das, Paul J. Heffernan, Giri Narasimhan. 303-308
• Recovery of Convex Hulls From External Visibility GraphsHazel Everett, Anna Lubiw, Joseph O Rourke. 309-314
• On the Notion of Completeness for Reconstruction Algorithms on Visibility GraphsG. Srinivasaraghavan, Asish Mukhopadhyay. 315-320
• The Continuous-graph Approach to Visibility ProblemsThomas C. Shermer. 321-321
• Finding the Maximum Area Axis-parallel Rectangle in a PolygonKaren L. Daniels, Victor Milenkovic, Dan Roth. 322-327
• Finding the Largest M-dimensional Circle in a K-dimensional BoxIvan Stojmenovic. 328-333
• An Optimal Algorithm for Solving the Restricted Minimal Convex Nested Polygonal Separation ProblemD. P. Wang, Richard C. T. Lee. 334-339
• Constrained Delaunay Triangulation RevisitedJean-Michel Moreau, Pascal Volino. 340-345
• On Equiangularity of Delaunay Diagrams in Every DimensionDominique Schmitt, Jean-Claude Spehner. 346-351
• Tighter Bounds on Voronoi Diagrams of Moving PointsThomas Roos. 358-363
• Near-quadratic Bounds for the ItL_1 Voronoi Diagram of Moving PointsL. Paul Chew. 364-369
• A Note on Generalizations of Chew s Algorithm for the Voronoi Diagram of a Convex PolygonRolf Klein, Andrzej Lingas. 370-374
• On General Properties of Strictly Convex Smooth Distance Functions in R:::D:::Ngoc-Minh Lê. 375-380
• Reconstructing Polygons From X-RaysHenk Meijer, Steven Skiena. 381-386
• Testing Simple PolygonsEsther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine. 387
• Optimal Floodlight Illumination of StagesJurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia. 393-398
• The Floodlight ProblemProsenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia. 399-404
• Low Level Issues in Computational GeometryChee Yap. 405-419
• Widest-corridor ProblemsRavi Janardan, Franco P. Preparata. 426-431
• Finding Maximally Consistent Sets of HalfspacesAlon Efrat, Micha Lindenbaum, Micha Sharir. 432-436
• Two-dimensional Computation of the Three-dimensional Reachable Region for a Welding HeadMichael McAllister, Jack Snoeyink. 437-442
• How to Look Around a CornerChristian Icking, Rolf Klein, Lihong Ma. 443-448
• Translational Motion Planning for a Convex Polyhedron in a 3D Polyhedral World Using an Efficient and New RoadmapAbhi Dattasharma, S. Sathiya Keerthi. 449-454
• The Lawnmower ProblemEsther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell. 461-466
• On Restricted Boundary Covers and Convex Three-CoversPatrice Belleville. 467-472
• Robust Construction of the Voronoi Diagram of a PolyhedronVictor Milenkovic. 473-478
• A Robust Algorithm for Point in PolyhedronC. Bradford Barber, Michael D. Hirsch. 479-484
• Rational Orthogonal Approximations to Orthogonal MatricesVictor Milenkovic, Veljko Milenkovic. 485-490