Abstract is missing.
- A Subexponential Bound for Linear ProgrammingJirí Matousek, Micha Sharir, Emo Welzl. 1-8 [doi]
- A Class of Convex Programs with Applications to Computational GeometryMartin E. Dyer. 9-15 [doi]
- Linear Optimization QueriesJirí Matousek, Otfried Schwarzkopf. 16-25 [doi]
- Degenerate Convex Hulls in High Dimensions without Extra StorageGünter Rote. 26-32 [doi]
- Optimal Parallel Algorithms for Triangulated Simple PolygonsJohn Hershberger. 33-42 [doi]
- Incremental Topological Flipping Works for Regular TriangulationsHerbert Edelsbrunner, Nimish R. Shah. 43-52 [doi]
- An Upper Bound for Conforming Delaunay TriangulationsHerbert Edelsbrunner, Tiow Seng Tan. 53-62 [doi]
- An Optimal Parallel Algorithm for Detecting Weak Visibility of a Simple PolygonDanny Z. Chen. 63-72 [doi]
- Digital Geometry (Abstract)Azriel Rosenfeld. 73
- An Efficient Approach to Removing Geometric DegeneraciesIoannis Z. Emiris, John F. Canny. 74-82 [doi]
- Numerical Stability of Algorithms for 2D Delaunay TriangulationsSteven Fortune. 83-92 [doi]
- Approximate Decision Algorithms for Point Set CongruencePaul J. Heffernan, Stefan Schirra. 93-101 [doi]
- Measuring the Resemblance of Polygonal CurvesHelmut Alt, Michael Godau. 102-109 [doi]
- On Dynamic Voronoi Diagrams and the Minimum Hausdorff Distance for Point Sets Under Euclidean Motion in the PlaneDaniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg. 110-119 [doi]
- Diameter, Width, Closest Line Pair, and Parametric SearchingBernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir. 120-129 [doi]
- Incidence and Nearest-Neighbor Problems for Lines in 3-SpaceMarco Pellegrini. 130-137 [doi]
- Computing and Verifying Depth OrdersMark de Berg, Mark H. Overmars, Otfried Schwarzkopf. 138-145 [doi]
- Castles in the Air RevisitedBoris Aronov, Micha Sharir. 146-156 [doi]
- Piercing Convex SetsNoga Alon, Daniel J. Kleitman. 157-160 [doi]
- Computing the Volume, Counting Integral Points, and Exponential SumsAlexander I. Barvinok. 161-170 [doi]
- There is a Universal Topological PlaneJacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu. 171-176 [doi]
- A Linear-Time Algorithm for Testing the Inscribability of Trivalent PolyhedraMichael B. Dillencourt, Warren D. Smith. 177-185 [doi]
- Coping with Inconsistencies: A New Approach to Produce Quality Triangulations of Polygonal Domains with HolesElefterios A. Melissaratos, Diane L. Souvaine. 202-211 [doi]
- Quality Mesh Generation in Three DimensionsScott A. Mitchell, Stephen A. Vavasis. 212-221 [doi]
- Triangulating Polygons without Large AnglesMarshall W. Bern, David P. Dobkin, David Eppstein. 222-231 [doi]
- Optical Computational GeometryY. B. Karasik, Micha Sharir. 232-241 [doi]
- Stable Placements for Spider RobotsJean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata. 242-250 [doi]
- A Rational Rotation Method for Robust Geometric AlgorithmsJohn F. Canny, Bruce Randall Donald, Eugene K. Ressler. 251-260 [doi]
- A Framework for Dynamic Graph DrawingRobert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis, Paola Bertolazzi. 261-270 [doi]
- How Hard is Halfspace Range Searching?Hervé Brönnimann, Bernard Chazelle. 271-275 [doi]
- Range Searching with Efficient Hierarchical CuttingsJirí Matousek. 276-285 [doi]
- Minimum Dissection of Rectilinear Polygon with Arbitrary Holes into RectanglesValeriu Soltan, Alexei Gorpinevich. 296-302 [doi]
- Intersection Detection and Separators for Simple PolygonsDavid M. Mount. 303-311 [doi]
- Manhattonian Proximity in a Simple PolygonRolf Klein, Andrzej Lingas. 312-319 [doi]
- Finding ::::k:::: Farthest Pairs and ::::k:::: Closest/Farthest Bichromatic Pairs for Points in the PlaneNaoki Katoh, Kazuo Iwano. 320-329 [doi]
- An Optimal Algorithm for the On-Line Closest-Pair ProblemChristian Schwarz, Michiel H. M. Smid, Jack Snoeyink. 330-336 [doi]
- On-Line Steiner Trees in the Euclidean PlaneNoga Alon, Yossi Azar. 337-343 [doi]
- ::::A Priori:::: Inequalities for the Euclidean Traveling SalesmanTimothy Law Snyder, J. Michael Steele. 344-349 [doi]
- Determining Contractibility of CurvesHaijo Schipper. 358-367 [doi]