Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG'05, University of Windsor, Ontario, Canada, August 10-12, 2005.
17. CCCG 2005:
University of Windsor, Ontario, Canada
: The min-# problem, a hybrid error criterion for near linear time performance.
: Optimal convex partitions of point sets with few inner points.
: New results on Pseudo-triangulations with low vertex degree.
: Compactly Encoding and Decoding the Connectivity of a Plane Graph in Linear Time.
: Feasibility of the Exact Geometric Computation Paradigm for Largest Empty Anchored Cylinder Computation in the Plane.
, Yuval Scharf
: The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon.
: Designing Modern Linkages to Trace Bezier Curves.
: Maximum Independent Set for Intervals by Divide-Prune-and-Conquer.
: Solving online feasibility problem in constant amortized time per update.
: Computing bitangents for ellipses.