Proceedings of the 5th Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada, August 1993.
University of Waterloo 1993
5. CCCG 1993:
Waterloo, Ontario, Canada
: Geometric Orderings and Helly-type Theorem for Intersecting Translates in the Plane.
: Lower Bounds for the Complexity of the Hausdorff Distance.
: Arrangements of Surfaces in Higher Dimensions: Envelopes Single Cells and Other Recent Developments.
: On Minimum and Maximum Visibility Problem.
Tamal K. Dey
: Optimal Algorithms to Detect Null-homologous Cycles on 2-manifolds.
: On the Minimal Number of Volume Intersection Operations Necessary for Reconstructing a 3D Object.
: Finding the Largest M-dimensional Circle in a K-dimensional Box.
D. P. Wang
, Richard C. T. Lee
: An Optimal Algorithm for Solving the Restricted Minimal Convex Nested Polygonal Separation Problem.
: Systematic Local Flip Rules Are Generalized Delaunay Rules.
: Tighter Bounds on Voronoi Diagrams of Moving Points.
L. Paul Chew
: Near-quadratic Bounds for the ItL_1 Voronoi Diagram of Moving Points.
, Andrzej Lingas
: A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon.
: On General Properties of Strictly Convex Smooth Distance Functions in RD.
: Low Level Issues in Computational Geometry.
: Robust Construction of the Voronoi Diagram of a Polyhedron.