Minimum vertex hulls for polyhedral domains [chapter]

Gautam Das, Deborah Joseph
1990 Lecture Notes in Computer Science  
Das, G. and D. Joseph, Minimum vertex hulls for polyhedral domains, Theoretical Computer Science 103 (1992) 107-135: Given a collection of pairwise disjoint polygons on the plane, we wish to cover each polygon with an exterior hull such that (1) the hulls are pairwise disjoint, and (2) the total number of vertices of the hulls is minimized. This problem has applications in the area of object approximations. Various versions of this problem (in two, and higher dimensions) are shown to be
more » ... The paper also describes several approximations and exact algorithms for the problem.
doi:10.1007/3-540-52282-4_37 fatcat:tltphozm6zdibhsnkxr33mmmka