A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
We present efficient algorithms for partitioning 2dimensional space into faces arising from the boundaries of overlapping polygons. In particular, we examine the case where the partitioning arises from overlaying m k-sided simple polygons. A dynamic data structure is presented for storing the partitioning that arises from m polygons with at most k sides each in space O(km 2 ) if the polygons are assumed to be convex, and space O(k 2 m 2 ) for simple polygons. Our structure returns T distinctdblp:conf/cccg/MacgillivrayN14 fatcat:xtwtpkawh5a6vflkdili43woj4