FREE-FORM SURFACE PARTITION IN 3-D
We present a theoretical study of a problem related to optimal free-form surface partitioning, which arises in surface machining in manufacturing. In particular, we consider partitioning a free-form surface in 3-D into two subsurfaces subject to a global objective function. As a key subroutine, we develop new algorithms for the geometric problem of processing an off-line sequence of insertions and deletions of convex polygons alternated with point membership/proximity queries on the common intersection of the polygons. We show how this subroutine can be used to solve surface 2-partitioning. Our algorithm for the 2-partitioning problem takes [Formula: see text] time, where m is the number of polygons of size O(n) each. This improves the asymptotic time complexity of the previous best-known O(m2n2)-time algorithm. Our algorithms may be applicable to other accessibility and partition problems involving free-form surfaces in computer graphics and manufacturing. From the computational geometry point of view, our method combines nontrivial data structures, geometric observations, and algorithmic techniques that may be used to solve other geometric problems. For example, our algorithm can process O(n) insertions and deletions of convex polygons (of size O(n) each) and queries on their intersections in O(n2 log log n) time, improving the "standard" O(n2 log n) time solution.