Abstract
The complexity of the contour of the union of simple polygons can be O(n 2) in general. In this paper, a necessary and sufficient condition is given for simple polygons which guarantees smaller union complexity. A δ-corridor in a polygon is a passage between two edges with width/length ratio δ. If a set of polygons with n vertices in total has no δ-corridors, then the union size is O((n log log n)/δ), which is close to optimal in the worst case. The result has many applications to basic problems in computational geometry, such as efficient hidden surface removal, motion planning, injection molding, etc. The result is based on a new method to partition a simple polygon P with n vertices into O(n) convex quadrilaterals, without introducing angles smaller than π/12 radians or narrow corridors. Furthermore, a convex quadrilateral can be covered (but not partitioned) with O(1/δ) triangles without introducing small angles. The maximum overlap of the triangles at any point is two. The algorithms take O(n log2 n) and O(n log2 n+n/δ time for partitioning and covering, respectively.
The research of the author is supported by an NSERC international fellowship.
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., and M. Sharir, Applications of a new partitioning scheme. Discr. & Comp. Geom., to appear.
Alt, H., R. Fleischer, M. Kaufmann, K. Mehlhorn, S. Näher, S. Shirra, and C. Uhrig, Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. Proc. 6th ACM Symp. Comp. Geom. (1990), pp. 281–289.
Bose, J., M. van Kreveld, and G. Toussaint, Filling polyhedral molds. Tech. Rep. SOCS 93.1, School of Computer Science, McGill University, 1993. Extended abstract in these proceedings.
Edelsbrunner, H., L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir, and J. Snoeyink, On arrangements of Jordan arcs with three intersections per pair. Discr. & Comp. Geom. 4 (1989), pp. 523–539.
Katz, M.J., M.H. Overmars, and M. Sharir, Efficient hidden surface removal for objects with small union size. Proc. 7th ACM Symp. Comp. Geom. (1991), pp. 31–40.
Kedem, K., R. Livne, J. Pach, and M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discr. & Comp. Geom. 1 (1986), pp. 59–71.
Latombe, J.-C., Robot motion planning. Kluwer Academic Publishers, Boston, 1991.
Lee, D.T., Medial axis transformation of a planar shape. IEEE Trans. Pattern Anal. Mach. Intel. 4 (1982), pp. 363–369.
Matoušek, J., N. Miller, J. Pach, M. Sharir, S. Sifrony, and E. Welzl, Fat triangles determine linearly many holes. Proc. 32nd IEEE Symp. Found. Comp. Science (1991), pp. 49–58.
Miller, N., and M. Sharir, Efficient randomized algorithms for constructing the union of fat triangles and of pseudodiscs. Manuscript, 1993.
Sharir, M., Efficient algorithms for planning purely translational collisionfree motion in two and three dimensions. Proc. IEEE Int. Conf. on Robotics and Automation (1987), pp. 1326–1331.
Yap, C.K., An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments. Discr. & Comp. Geom. 2 (1987), pp. 365–393.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Kreveld, M. (1993). On fat partitioning, fat covering and the union size of polygons. In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_270
Download citation
DOI: https://doi.org/10.1007/3-540-57155-8_270
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57155-1
Online ISBN: 978-3-540-47918-5
eBook Packages: Springer Book Archive