We present a new approach to the development of efficient geometric algorithms
for freeform curves and surfaces. Preprocessing the given curves and surfaces
and representing them in a hierarchical data structure, we show that a variety of
geometric algorithms can be greatly accelerated. We demonstrate the effectiveness
of this approach by developing real-time algorithms for collision detection, minimum
and Hausdorff distance computation, convex hull computation for freeform models.
This is a joint work with Yong-Joon Kim and Gershon Elber.
