Table of Contents

• New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in TerrainsDan Halperin, Micha Sharir. 11-18 [doi]
• On Lines Missing Polyhedral Sets in 3-SpaceMarco Pellegrini. 19-28 [doi]
• Combinatorial Complexity of Translating a Box in Polyhedral 3-SpaceDan Halperin, Chee-Keng Yap. 29-37 [doi]
• An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal ProblemsHazel Everett, Jean-Marc Robert, Marc J. van Kreveld. 38-46 [doi]
• Computing the DiscrepancyDavid P. Dobkin, David Eppstein. 47-52 [doi]
• Optimally Sparse Spanners in 3-Dimensional Euclidean SpaceGautam Das, Paul J. Heffernan, Giri Narasimhan. 53-62 [doi]
• Helly Theorems and Generalized Linear ProgrammingNina Amenta. 63-72 [doi]
• Geometric Partitioning Made Easier, Even in ParallelMichael T. Goodrich. 73-82 [doi]
• Approximating Center Points with Iterated Radon PointsKenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng. 91-98 [doi]
• On the Topological Shape of Planar Voronoi DiagramsA. Corbalan, M. L. Mazón, Tomás Recio, Francisco Santos. 109-115 [doi]
• Convex Distance Functions in 3-Space are DifferentChristian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma. 116-123 [doi]
• A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple PolygonRolf Klein, Andrzej Lingas. 124-132 [doi]
• Tentative Prune-and-Search for Computing Voronoi VerticesDavid G. Kirkpatrick, Jack Snoeyink. 133-142 [doi]
• Optimal Motion Planning for a Rod in the Plane Subject to Velocity ConstraintsYui-Bin Chen, Doug Ierardi. 143-152 [doi]
• A Compaction Algorithm for Non-Convex Polygons and Its ApplicationZhenyu Li, Victor Milenkovic. 153-162 [doi]
• Efficient Exact Arithmetic for Computational GeometrySteven Fortune, Christopher J. Van Wyk. 163-172 [doi]
• Area Optimization of Simple PolygonsSándor P. Fekete, William R. Pulleyblank. 173-182 [doi]
• Worst-Case Bounds for Subadditive Geometric GraphsMarshall W. Bern, David Eppstein. 183-188 [doi]
• Finding a Minimum Weight K-Link Path in Graphs with Monge Property and ApplicationsAlok Aggarwal, Baruch Schieber, Takeshi Tokuyama. 189-197 [doi]
• An Expander-Based Approach to Geometric OptimizationMatthew J. Katz, Micha Sharir. 198-207 [doi]
• Dominance Range-Query: The One-Reporting CaseThomas Dubé. 208-217 [doi]
• The Union of Balls and Its Dual ShapeHerbert Edelsbrunner. 218-231 [doi]
• An Incremental Algorithm for Betti Numbers of Simplicial ComplexesCecil Jose A. Delfinado, Herbert Edelsbrunner. 232-239 [doi]
• Dehn-Sommerville Relations, Upper Bound Theorem, and Levels in ArrangementsKetan Mulmuley. 240-246 [doi]
• Objects That Cannot be Taken Apart with Two HandsJack Snoeyink, Jorge Stolfi. 247-256 [doi]
• Long Non-Crossing Configurations in the PlaneNoga Alon, Sridhar Rajagopalan, Subhash Suri. 257-263 [doi]
• Some Geometric Applications of Dilworth s TheoremJános Pach, Jenö Töröcsik. 264-269 [doi]
• Counting Triangle Crossings and Halving PlanesTamal K. Dey, Herbert Edelsbrunner. 270-273 [doi]
• Guaranteed-Quality Mesh Generation for Curved SurfacesL. Paul Chew. 274-280 [doi]
• Compatible TetrahedralizationsMarshall W. Bern. 281-288 [doi]
• An NC Parallel 3D Convex Hull AlgorithmNancy M. Amato, Franco P. Preparata. 289-297 [doi]
• Scalable Parallel Geometric Algorithms for Coarse Grained MulticomputersFrank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin. 298-307 [doi]
• Shortest Paths Among Obstacles in the PlaneJoseph S. B. Mitchell. 308-317 [doi]
• Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic TriangulationsMichael T. Goodrich, Roberto Tamassia. 318-327 [doi]
• The Visibility ComplexMichel Pocchiola, Gert Vegter. 328-337 [doi]
• Can Visibility Graphs be Represented Compactly?Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri. 338-347 [doi]
• An Optimal Algorithm for the Two-Guard ProblemPaul J. Heffernan. 348-358 [doi]
• Area-Efficient Upward Tree DrawingsAshim Garg, Michael T. Goodrich, Roberto Tamassia. 359-368 [doi]
• Decision Trees for Geometric ModelsEsther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena. 369-378 [doi]
• The Power of Geometric Duality and Minkowski Sums in Optical Computational GeometryY. B. Karasik, Micha Sharir. 379-388 [doi]
• Building and Using Polyhedral HierarchiesDavid P. Dobkin, Ayellet Tal. 394 [doi]
• Moving a Disc Between PolygonsStefan Schirra. 395-396 [doi]
• Compliant Motion in a Simple PolygonJohn Hershberger. 397-398 [doi]
• Implementation of a Motion Planning System in Three DimensionsEstarose Wolfson, Micha Sharir. 399-400 [doi]
• Animation of Geometric Algorithms Using GeoLabPedro Jussieu de Rezende, Welson R. Jacometti. 401-402 [doi]
• Ranger: A Tool for Nearest Neighbor Search in High DimensionsMichael Murphy, Steven Skiena. 403-404 [doi]
• Video: Objects that Cannot be Taken Apart with Two HandsJack Snoeyink. 405 [doi]