%{search_type} search results

• Invited Lecture by Roberto Tamassia Robust proximity queries in implicit Voronoi diagrams / R. Tamassia, G. Liotta and F.P. Preparata
• O-Convexity: Computing hulls, approximations, and orientation sets / V. Martynchik, N. Metelski and D. Wood
• Efficient algorithms for counting and reporting pairwise intersections between convex polygons / P. Gupta, R. Janardan and M.I. Smid
• Convex hulls of bounded curvature / J.-D. Boissonnat and S. Lazard
• Enclosing k points in the smallest axis parallel rectangle / M. Segal and K. Kedem
• Finding the set of all minimal nested convex polygons / J. Bhadury and R. Chandrasekaran
• Optimizing a corridor between two polygons with an application to polyhedral interpolation / G. Barequet and B. Wolfers.

The 8th Canadian conference on computational geometry had an international flavour. Sixty-one papers were submitted by authors from over 20 countries representing four continents. The conference was held at Carleton University in August 1996.
(source: Nielsen Book Data)