Precise convex hull computation for freeform models using a hierarchical Gauss map and a Coons bounding volume hierarchy
Present an interactive-speed algorithm for computing the precise convex hull of freeform geometric models. Employing two pre-built data structures, a hierarchical Gauss map and a Coons bounding volume hierarchy, we develop an efficient culling technique that can eliminate the majority of redundant surface patches. Construct the precise convex hull boundary using numerical methods.
convex hulls freeform surfaces support distance upper envelope stereographic projection tritangent developable scroll