%A W. Lenhart
%A R. Pollack
%A J. Sack
%A R. Seidel
%A M. Sharir
%A S. Suri
%A G. Toussaint
%A C. Yap
%A S. Whitesides
%T Computing the link center of a simple polygon
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A J. Hershberger
%T Finding the visibility graph of a simple polygon
in time proportional to its size
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A F. Aurenhammer
%T Jordan sorting via convex hulls of certain non-simple polygons
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A C. Papadimitriou
%A J. Mitchell
%T The weighted region problem
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A B. Aronov
%T On the geodesic voronoi diagram of point sites in a simple polygon
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A L.J. Guibas
%A J. Hershberger
%T Optimal shortest path queries in a simple polygon
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A S. Suri
%T The all-geodesic-furthest neighbor problem for simple polygons
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A Branko Grunbaum
%T New directions in the theory of polyhedra
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A J. Stolfi
%T Oriented projective geometry
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A D.P. Dobkin
%A M.J. Laszlo
%T Primitives for the manipulation of three-dimensional subdivisions
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A L. De\ Floriani
%T A graph based approach to object feature recognition
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A W.R. Franklin
%T Polygon properties calculated from the vertex neighborhoods
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A T. Ottmann
%A G. Thiemt
%A C. Ullrich
%T Numerical stability of geometric algorithms
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A R.L. Drysdale
%A R.B. Jerard
%T Discrete simulation of NC machining
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A Ed Catmull
%T Visualization of volumes
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A Y. Ke
%A J. O'Rourke
%T Moving a ladder in three dimensions: upper and lower bounds
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A B.K. Natarajan
%T On detecting the orientation of polygons and polyhedra
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A J. Canny
%A B. Donald
%T Simplified Voronoi diagrams
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A P.D. Alevizos
%A J. Boissonnat
%A M. Yvinec
%T An optimal O(n log n) algorithm for contour reconstruction from rays
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A C. Bajaj
%A M. Kim
%T Compliant motion planning with geometric models
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A R. Seidel
%T On the number of faces in higher-dimensional voronoi diagrams
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A M. Dillencourt
%T Toughness and Delaunay triangulations
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A A. Saalfeld
%T Joint triangulations and triangulation maps
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A N. Dadoun
%A D.G. Kirkpatrick
%T Parallel processing for efficient subdivision search
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A L.P. Chew
%T Constrained Delaunay triangulations
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A C. Wang
%A L. Schubert
%T An optimal algorithm for constructing the Delaunay triangulation
of a set of line segments
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A J.W. Jaromczyk
%A M. Kowaluk
%T A note on relative neighborhood graphs
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A F. Avnaim
%A J. Boissonnat
%T Simultaneous containment of several polygons
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A Sheeram Abhyankar
%T Glimpses of algebraic geometry
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A K. Clarkson
%A S. Kapoor
%A P. Vaidya
%T Rectilinear shortest paths through polygonal obstacles in O(n log^2 n) time
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A M. Edahiro
%A K. Tanaka
%A T. Hoshino
%A T. Asano
%T A bucketing algorithm for the orthogonal segment intersection search problem
and its practical efficiency
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A R.A. Reckhow
%A J. Culberson
%T Covering a simple orthogonal polygon
with a minimum number of orthogonally convex polygons
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A A. Aggarwal
%A S. Suri
%T Fast algorithms for computing the largest empty rectangle
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A J.I. Munro
%A M.H. Overmars
%A D. Wood
%T Variations on visibility
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A D. Avis
%A R. Wenger
%T Algorithms for line transversals in space
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A H. Alt
%A K. Melhorn
%A H. Wagener
%A E. Welzl
%T Congruence, simularity, and symmetries of geometric objects
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A D.G. Kirkpatrick
%T Establishing order in planar subdivisions
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A D. Rappaport
%T Computing simple circuits from a set of line segments is NP-complete
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A N. Alon
%A D. Haussler
%A E. Welzl
%T Partitioning and geometric embedding
of range spaces of finite Vapnik-Chervonenkis dimension
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A J. Warren
%T Constructing low degree blending surfaces
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo

%A A. Schwartz
%A C.M. Stanton
%T Analyzing surfaces: the truth about elimination theory
%J Proceedings of the Symposium on Computational Geometry
%C Waterloo, Ontario
%D June 1987
%K comp_geo