17. CCCG 2005:
University of Windsor, Ontario, Canada
Lilian Buzer:
The min-# problem, a hybrid error criterion for near linear time performance.
23-26
Andreas Spillner:
Optimal convex partitions of point sets with few inner points.
39-42
André Schulz:
New results on Pseudo-triangulations with low vertex degree.
130-133
Raquel Viaña:
Compactly Encoding and Decoding the Connectivity of a Plane Graph in Linear Time.
142-145
Stefan Schirra:
Feasibility of the Exact Geometric Computation Paradigm for Largest Empty Anchored Cylinder Computation in the Plane.
171-174
Gill Barequet,
Yuval Scharf:
The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon.
175-178
James Factor:
Designing Modern Linkages to Trace Bezier Curves.
207-210
Jack Snoeyink:
Maximum Independent Set for Intervals by Divide-Prune-and-Conquer.
264-265
Lilian Buzer:
Solving online feasibility problem in constant amortized time per update.
286-289
Luc Habert:
Computing bitangents for ellipses.
294-297
data released under the ODC-BY 1.0 license
