Pankaj K. Agarwal A Deterministic Algorithm for Partitioning Arrangements of Lines and Its Application. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:11-22 [Conf]

Mike Paterson, F. Frances Yao Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:23-32 [Conf]

Gert Vegter Kink-Free Deformations of Polygons. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:61-68 [Conf]

Yan Ke An Efficient Algorithm for Link-Distance Problems. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:69-78 [Conf]

Erich Kaltofen Computing the Irreducible Real Factors and Components of an Algebraic Curve. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:79-87 [Conf]

Herbert Edelsbrunner An Acyclicity Theorem for Cell Complexes in d Dimensions. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:145-151 [Conf]

L. Paul Chew, Klara Kedem Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:167-173 [Conf]

Amy J. Briggs An Efficient Algorithm for One-Step Planar Complaint Motion Planning with Uncertainty. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:187-196 [Conf]

Victor Milenkovic Calculating Approximate Curve Arrangements Using Rounded Arithmetic. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:197-207 [Conf]

Erik Brisson Representing Geometric Structures in d Dimensions: Topology and Order. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:218-227 [Conf]

Pascal Lienhardt Subdivisions of n-Dimensional Spaces and n-Dimensional Generalized Maps. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:228-236 [Conf]

Jan-Ming Ho, D. T. Lee Bounded Diameter Minimum Spanning Trees and Related Problems. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:276-282 [Conf]

Pankaj K. Agarwal Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:315-325 [Conf]

Rex A. Dwyer Higher-Dimensional Voronoi Diagrams in Linear Expected Time. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:326-333 [Conf]

Jim Ruppert, Raimund Seidel On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:380-392 [Conf]