Abstract is missing.
- Robust Proximity Queries in Implicit Voronoi DiagramsRoberto Tamassia, Giuseppe Liotta, Franco P. Preparata. 1-1
- O-Convexity Computing Hulls Approximations and Orientation SetsV. Martynchik, Nikolai N. Metelski, Derick Wood. 2-7
- Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex PolygonsProsenjit Gupta, Ravi Janardan, Michiel H. M. Smid. 8-13
- Convex Hulls of Bounded CurvatureJean-Daniel Boissonnat, Sylvain Lazard. 14-19
- Enclosing K Points in the Smallest Axis Parallel RectangleMichael Segal, Klara Kedem. 20-25
- Finding the Set of All Minimal Nested Convex PolygonsJoy Bhadury, Ramaswamy Chandrasekaran. 26-31
- Optimizing a Corridor Between Two Polygons with an Application to Polyhedral InterpolationGill Barequet, Barbara Wolfers. 32-37
- Heuristics for the Generation of Random PolygonsThomas Auer, Martin Held. 38-43
- Orthogonal Polygon ReconstructionL. Jackson, Stephen K. Wismath. 44-49
- Correcting Topological Defects of TessellationsDong Wang, John A. Goldak. 50-55
- Generating Rooted Triangulations with Minimum Degree FourDavid Avis, Chiu Ming Kong. 56-61
- On Stable Line Segments in TriangulationsAndranik Mirzaian, Cao An Wang, Yin-Feng Xu. 62-67
- Diamonds Are Not a Minimum Weight Triangulation s Best FriendProsenjit Bose, Luc Devroye, William S. Evans. 68-73
- Stabbing Information of a Simple PolygonHazel Everett, Ferran Hurtado, Marc Noy. 74-79
- K-transversals of Parallel Convex SetsNina Amenta. 80-86
- Fast Stabbing of Boxes in High DimensionsFrank Nielsen. 87-92
- Shooter Location ProblemSubhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya. 93-98
- Computational Geometry for Interrogative VisualizationChandrajit L. Bajaj. 99-100
- An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related ProblemsSergei Bespamyatnikh. 101-106
- A Topology Oriented Algorithm for the Voronoi Diagram of PolygonsToshiyuki Imai. 107-112
- On Non-smooth Convex Distance FunctionsNgoc-Minh Lê. 113-118
- Time-optimal Proximity Graph Computations on Enhanced MeshesStephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya. 119-124
- Deforming Curves in the Plane for Tethered-robot Motion PlanningSusan Hert, Vladimir J. Lumelsky. 125-130
- Heuristic Motion Planning with Movable ObstaclesThomas Chadzelek, Jens Eckstein, Elmar Schömer. 131-136
- Viewing a Set of Spheres while Moving on a Linear FlightpathFrank Follert. 137-142
- Approximating Shortest Paths in Arrangements of LinesProsenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink. 143-148
- Velocity Planning for a Robot Moving along the Shortest Straight Line Path Among Moving ObstaclesKamala Krithivasan, Anna Rema, Stefan Schirra, P. I. Vijaykumar. 149-154
- Lower Bounds for Computing Geometric Spanners and Approximate Shortest PathsDanny Z. Chen, Gautam Das, Michiel H. M. Smid. 155-160
- On the Reachable Regions of ChainsNaixun Pei, Sue Whitesides. 161-166
- Heuristic Motion Planning with Many Degrees of FreedomThomas Chadzelek, Jens Eckstein, Elmar Schömer. 167-172
- Computing Largest Circles Separating Two Sets of SegmentsJean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec. 173-178
- On the Permutations Generated by Rotational Sweeps of Planar Point SetsHanspeter Bieri, Peter-Michael Schmidt. 179-184
- Maximal Length Common Non-intersecting PathsJurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia. 185-189
- Maintaining Multiple Levels of Detail in the Overlay of Hierarchical Sub DivisionsPaola Magillo, Leila De Floriani. 190-195
- Distance-based Subdivision for Translational LP ContainmentKaren L. Daniels, Victor J. Milenkovic. 196-201
- Variable Resolution Terrain SurfacesEnrico Puppo. 202-210
- Generalizing HalfspacesEugene Fink, Derick Wood. 211-216
- Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral TerrainProsenjit Bose, David G. Kirkpatrick, Zaiqing Li. 217-222
- The Surveillance of the Walls of an Art GalleryAldo Laurentini. 223-233
- On Rectangle Visibility Graphs. III. External Visibility and ComplexityThomas C. Shermer. 234-239
- Maintaining Visibility of a Polygon with a Moving Point of ViewDanny Z. Chen, Ovidiu Daescu. 240-245
- Visibility Graph of a Set of Line Sements: A Dynamic Sequential Algorithm and Its Parallel VersionYosser Atassi. 246-251
- Dynamic Algorithms for Approximate Neighbor SearchingSergei Bespamyatnikh. 252-257
- Three-dimensional Restricted-Orient at Ion ConvexityEugene Fink, Derick Wood. 258-263
- Efficient Algorithms for the Smallest Enclosing Cylinder ProblemElmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap. 264-269
- On the omega(n:::4/3:::) Weak Lower Bounds for Some 3D Geometric ProblemsBinhai Zhu. 270-275
- Computational Geometry Impact Potential: A Business and Industrial PerspectivePrabhakar Raghavan. 276
- Probalistic Algorithms for Efficient Grasping and FixturingMarek Teichmann. 277-282
- On a Problem of Immobilizing PolygonsJurek Czyzowicz, Ivan Stojmenovic, Tomasz Szymacha. 283-288
- Finding an o(n:::2::: log n) Algorithm Is Sometimes HardAntonio Hernández-Barrera. 289-294
- Improved Orthogonal Drawings of 3-graphsTherese C. Biedl. 295-299
- Algorithms on Polygonal Embeddings of GraphsLeizhen Cai. 300-305
- Optimal Orthogonal Drawings of Connected Plane GraphsTherese C. Biedl. 306-311
- Straight Line Embeddings of Planar Graphs on Point SetsNetzahualcoyotl Castañeda, Jorge Urrutia. 312-318
- Extending Rectangular Range Reporting with Query Sensitive AnalysisRobin Y. Flatland, Charles V. Stewart. 319-324
- The Complexity of Rivers in Triangulated TerrainsMark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu. 325-330
- Computing the Angularity ToleranceMark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong. 331-336
- The Complexity of Illuminating Polygons by alpha-flood-lightsJay Bagga, Laxmi Gewali, David Glasser. 337-342