Abstract
An algorithm for finding a polygon with minimum number of edges nested in two simplen-sided polygons is presented. The algorithm solves the problem in at mostO(n logn) time, and improves the time complexity of two previousO(n 2) algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aggarwal, A., Booth, H., O'Rourke, J., Suri, S., and Yap, C.,Finding minimal convex nested polygons, Proc. of the First AMC Symposium on Computational Geometry, (1985), 296–304.
Chazelle, B.,Triangulating a Simple Polygon in Linear Time, Spectral Feature on The Sixth ACM Symposium on Computational Geometry (1990).
Dasgupta, B. and Veini Madhavan, C.,An approximate algorithm for the minimal vertex nested polygon problem, Information Processing Letters, 33, (1989), 35–44.
Preparata, F. and Shamos, M.,Computational Geometry, Springer Verlag (1985).
Suri, S. and O'Rourke, J.,Finding Minimal Nested Polygons, Technical Report, The Johns Hopkins Univ. (1985).
Suri, S.,A linear time algorithm for finding minimum link paths inside a simple polygon, Computer Vision, Graphics, and Image Processing, 35, (1986), 99–110.
Wang, C. and Chan, E.,Finding the minimum visible vertex distance between two simple polygons, Proc. of The Second ACM Symposium On Computational Geometry, (1986), 34–42.
Wang, C.,Finding a minimal chain to separate two polygons, Proceedings on 27th Annual Allerton Conference on Communication, Control, and Computing, (1989), 574–583.
Author information
Authors and Affiliations
Additional information
The work was supported by NSERC grant OPG0041629.
Rights and permissions
About this article
Cite this article
Wang, C.A. Finding minimal nested polygons. BIT 31, 230–236 (1991). https://doi.org/10.1007/BF01931283
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01931283