Table of Contents

How solid is solid modeling?.- Robustness issues in geometric algorithms.- Implementing geometric algorithms robustly.- Robustness in geometric algorithms.- Applications of computational geometry in mechanical engineering design and manufacture.- On some applications of computational geometry in manufacturing and virtual environments.- Visualizing geometric algorithms — State of the art.- Geometric algorithm visualization, current status and future.- Position paper for panel discussion.- Designing the computational geometry algorithms library CGAL.- The computational geometry impact task force report: An executive summary.- Geometric manipulation of flexible ligands.- Ray-representation formalism for geometric computations on protein solid models.- Column-based strip packing using ordered and compliant containment.- Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design.- Geometric problems in machine learning.- Matching convex polygons and polyhedra, allowing for occlusion.- Stably placing piecewise smooth objects.- A beam-tracing algorithm for prediction of indoor radio propagation.- Extracting geometric information from architectural drawings.- Using the visibility complex for radiosity computation.- The CGAL kernel: A basis for geometric computation.- Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator.