Abstract is missing.
- A Deterministic Algorithm for Partitioning Arrangements of Lines and Its ApplicationPankaj K. Agarwal. 11-22 [doi]
- Binary Partitions with Applications to Hidden Surface Removal and Solid ModellingMike Paterson, F. Frances Yao. 23-32 [doi]
- A Fast Planar Partition Algorithm, IIKetan Mulmuley. 33-43 [doi]
- Detecting and Decomposing Self-Overlapping CurvesPeter W. Shor, Christopher J. Van Wyk. 44-50 [doi]
- Area Requirement and Symmetry Display in Drawing GraphsGiuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis. 51-60 [doi]
- Kink-Free Deformations of PolygonsGert Vegter. 61-68 [doi]
- An Efficient Algorithm for Link-Distance ProblemsYan Ke. 69-78 [doi]
- Computing the Irreducible Real Factors and Components of an Algebraic CurveErich Kaltofen. 79-87 [doi]
- Degree Complexity Bounds on the Intersection of Algebraic CurvesShreeram S. Abhyankar, Srinivasan Chandrasekar, Vijaya Chandru. 88-93 [doi]
- Hermite Interpolation of Rational Space Curves Using Real Algebraic SurfacesChandrajit L. Bajaj, Insung Ihm. 94-103 [doi]
- On the Parallel Decomposability of Geometric ProblemsMikhail J. Atallah, Jyh-Jong Tsay. 104-113 [doi]
- Optimal Parallel Algorithm for Visibility of a Simple Polygon from a PointMikhail J. Atallah, Danny Z. Chen. 114-123 [doi]
- Good Splitters for Counting Points in TrianglesJirí Matousek, Emo Welzl. 124-130 [doi]
- Computing Partial Sums in Multidimensional ArraysBernard Chazelle, Burton Rosenberg. 131-139 [doi]
- On the Number of Halving PlanesImre Bárány, Zoltán Füredi, László Lovász. 140-144 [doi]
- An Acyclicity Theorem for Cell Complexes in ::::d:::: DimensionsHerbert Edelsbrunner. 145-151 [doi]
- Necessary and Sufficient Conditions for Hyperplane TransversalsRichard Pollack, Rephael Wenger. 152-155 [doi]
- Efficient Motion Planning for an L-Shaped ObjectDan Halperin, Mark H. Overmars. 156-166 [doi]
- Placing the Largest Similar Copy of a Convex Polygon Among Polygonal ObstaclesL. Paul Chew, Klara Kedem. 167-173 [doi]
- Compliant Motion in a Simple PolygonJoseph Friedman, John Hershberger, Jack Snoeyink. 175-186 [doi]
- An Efficient Algorithm for One-Step Planar Complaint Motion Planning with UncertaintyAmy J. Briggs. 187-196 [doi]
- Calculating Approximate Curve Arrangements Using Rounded ArithmeticVictor Milenkovic. 197-207 [doi]
- Epsilon Geometry: Building Robust Algorithms from Imprecise ComputationsDavid Salesin, Jorge Stolfi, Leonidas J. Guibas. 208-217 [doi]
- Representing Geometric Structures in ::::d:::: Dimensions: Topology and OrderErik Brisson. 218-227 [doi]
- Subdivisions of ::::n::::-Dimensional Spaces and ::::n::::-Dimensional Generalized MapsPascal Lienhardt. 228-236 [doi]
- Probing a Scene of Non Convex PolyhedraJean-Daniel Boissonnat, Mariette Yvinec. 237-246 [doi]
- Determining Sector Visibility of a PolygonBinay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint. 247-253 [doi]
- Finding Tailored PartitionsJohn Hershberger, Subhash Suri. 255-265 [doi]
- Bounded Diameter Minimum Spanning Trees and Related ProblemsJan-Ming Ho, D. T. Lee. 276-282 [doi]
- Fining ::::k:::: Points with Minimum Spanning Trees and Related ProblemsAlok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri. 283-291 [doi]
- Fast Geometric Approximation Techniques and Geometric Embedding ProblemsMarshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber. 292-301 [doi]
- On Geometric MatchingOdile Marcotte, Subhash Suri. 302-314 [doi]
- Ray Shooting and Other Applications of Spanning Trees with Low Stabbing NumberPankaj K. Agarwal. 315-325 [doi]
- Higher-Dimensional Voronoi Diagrams in Linear Expected TimeRex A. Dwyer. 326-333 [doi]
- On Monotone Paths Among Obstacles with Applications to Planning AssembliesEsther M. Arkin, Robert Connelly, Joseph S. B. Mitchell. 334-343 [doi]
- Minimum Partitioning Simple Rectilinear Polygons in o(n log log n) TimeW. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee. 344-353 [doi]
- Sweeping Arrangements of CurvesJack Snoeyink, John Hershberger. 354-363 [doi]
- Stabbing Pairwise Disjoint Translates in Linear TimePeter Egyed, Rephael Wenger. 364-369 [doi]
- Computing the Geodesic Diameter of a 3-PolytopeJoseph O Rourke, Catherine A. Schevon. 370-379 [doi]
- On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex PolyhedraJim Ruppert, Raimund Seidel. 380-392 [doi]
- Triangulating a Non-Convex PolytypeBernard Chazelle, Leonidas Palios. 393-400 [doi]