Abstract is missing.
- Topological Walk RevisitedTetsuo Asano, Takeshi Tokuyama. 1-6
- A Pseudo-Algorithmic Separation of Lines from Pseudo-LinesWilliam L. Steiger, Ileana Streinu. 7-11
- Level Difference of the Reconstructed ArrangementMary Inaba, Yasukazu Aoki, Susumu Hasegawa. 12-17
- Minimal Tangent Visibility GraphsMichel Pocchiola, Gert Vegter. 24-29
- Planar Visibility GraphsShiou-Yi Lin, Chiuyuan Chen. 30-35
- Modeling with Simplicial ComplexesHerbert Edelsbrunner. 36-44
- Hunting Voronoi Vertices in Non-Polygonal DomainsVincenzo Ferrucci, Mark H. Overmars, Anil S. Rao, Jules Vleugels. 45-50
- Motion Planning for Vacuum Cleaner RobotsChantal Wentink, Otfried Schwarzkopf. 51-56
- Distribution Algorithms for the all-nearest-foreign-neighbors Problem in Arbitrary L:::t:::-metricsThorsten Graf, Klaus Hinrichs. 69-74
- The Region Approach for some Dynamic Closest-Point ProblemsSergei Bespamyatnikh. 75-80
- Optimal Floodlight Illumination of Orthogonal Art GalleriesVladimir Estivill-Castro, Jorge Urrutia. 81-86
- Positive and Negative Results on the Floodlight ProblemWilliam L. Steiger, Ileana Streinu. 87-92
- Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-completeChuzo Iwamoto, Godfried T. Toussaint. 93-98
- Optimal Slope Selection Via CuttingsHervé Brönnimann, Bernard Chazelle. 99-103
- An Efficient Solution to the Zookeeper s ProblemJohn Hershberger, Jack Snoeyink. 104-109
- Shortest Paths in a Simple Polygon in the Presence of Forbidden VerticesEvanthia Papadopoulou, D. T. Lee. 110-115
- Computing the Dent Diameter of a PolygonPeter Yamamoto. 116-121
- Revenge of the Dog: Queries on Voronoi Diagrams of Moving PointsOlivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra. 122-127
- On Computing Voronoi Diagrams of Convex Polyhedra by Means of Wavefront PropagationMartin Held. 128-133
- Some Qualitative Properties of a Generalized Voronoi Diagram for Convex Polyhedra in d-dimensionsAbhi Dattasharma. 134-139
- Worst-Case TSP Point Sets in All Dimensions are Asymptotically EquidistributedTimothy Law Snyder, J. Michael Steele. 147-152
- An Eight-Way Perturbation Technique for the Three-Dimensional Convex HullTsuyoshi Ono. 159-164
- Numerically Robust Algorithm for Contructing Constrained Delaunay TriangulationHiroshi Inagaki, Kokichi Sugihara. 171-176
- The Contrained Delaunay Pyramid - A Model for Reconstructing Surfaces at Multiple ResolutionsAndreas Voigtmann, Ludger Becker, Klaus Hinrichs. 177-182
- Recognizing S-Star PolygonsLaxmi Gewali. 183-188
- Generating Random x-Monotone Polygons with Given VerticesChong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell. 189-194
- On Delaunay oriented MatroidsFrancisco Santos. 195-200
- Optical Computer VisionY. B. Karasik. 207-211
- Constructing Optically in Constant Time the K-Level of an Arrangement of Lines in the Plane and Other Related ProblemsY. B. Karasik. 212-218
- Persistent Spatial Relations - a Systems Design ObjectiveChristopher M. Gold. 219-224
- Limited GapsKaren L. Daniels, Victor Milenkovic. 225-230
- The T-Hull Approach to Shape AnalysisPaul G. Mezey. 231-236
- Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric AlgorithmsPeter Hertling, Klaus Weihrauch. 237-242
- GASP - An Animation System for Computational GeometryDavid P. Dobkin, Ayellet Tal. 243-249
- Tolerance of Geometric StructuresManuel Abellanas, Ferran Hurtado, Pedro A. Ramos. 250-255
- Intersection Detection and Computation of Manhattan TerrainsBinhai Zhu. 256-262
- A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment IntersectionsTimothy M. Chan. 263-268
- Tolerance-Free NeST RepresentationsRyan Hayward, Paul E. Kearney. 275-280
- Orthogonal Drawings with the Minimum Number of BendsGiuseppe Liotta, Francesco Vargiu, Giuseppe Di Battista. 281-286
- Graph-Theoretical Conditions for Inscribability and Delaunay RealizabilityMichael B. Dillencourt, Warren D. Smith. 287-292
- Edge Guarding a Triangulated Polyhedral TerrainHazel Everett, Eduardo Rivera-Campo. 293-295
- Edge Guards on a FortressSiu-Ming Yiu, A. Choi. 296-301
- Generalized Guarding and Partitioning for Rectilinear PolygonsErvin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer. 302-307
- Optimal Rectilinear Steiner Minimal Trees in O (n:::2:::2.62:::n:::) TimeJoseph L. Ganley, James P. Cohoon. 308-313
- Convex Minimization on a Grid and ApplicationsClaudio Mirolo. 314-319
- Cardinality Bounds for Triangulations with Bounded Minimum AngleScott A. Mitchell. 326-331
- An Optimal Algorithm for Greedy Triangulation of a Set of PointsCao An Wang. 332-338
- Triangulating with High ConnectivityTamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh. 339-343
- All Convex Polyhedra can be Clamped with Parallel Jaw GrippersProsenjit Bose, David Bremner, Godfried T. Toussaint. 344-349
- The Size of a Generalized Voronoi Diagram for Convex Polyhedra in d-dimensionsAbhi Dattasharma. 357-362
- Link-2-Convex One-Fillable Polygons are StarshapedDavid Bremner. 363-368
- Reconstruction of Parallel Line Segments From Endpoint Visibility InformationStephen K. Wismath. 369-374
- Determining Weak External Visibility of Polygons in ParallelDanny Z. Chen. 375-380
- K-Guarding Polygons on the PlanePatrice Belleville, Prosenjit Bose, Jurek Czyzowicz, Jorge Urrutia, Joseph Zaks. 381-386
- Controlling GuardsGregorio Hernández-Peñalver. 387-392