Abstract
In this paper, we present a linear time algorithm for determining the intersection type of two star polygons and prove its correctness. The algorithm exploits the sorted angular order of the vertices of a star polygon and, thus, avoiding the general step of sorting the polygonal vertices.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M.I.Shamos,Computational Geometry,Ph.D. Thesis,Yale University,1978.
D.Montuno and A.Fournier,"Detecting Intersection among Star Polygons",Computer Systems Research Group,University of Toronto, Tech.Rept.CSRG-146 (September 1982).
H.Freeman and P.P.Loutrel,"An algorithm for the solution of the two dimensional hidden line problem",IEEE Trans. Electron. Comput. EC-16,No.6 (December 1967),784–790.
D.T. Lee,"Visibility of a Simple Polygon",Computer Vision,Graphics and Image Processing,vol.22,no.2(May 1983),207–221.
B.Chazelle and D.P.Dobkin, "Detection is easier than computation", Proc. of 12th ACM Symposium on Theory of Computing, Los Angles (1980), 146–153.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghosh, S.K. (1984). A linear-time algorithm for determining the intersection type of two star polygons. In: Joseph, M., Shyamasundar, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1984. Lecture Notes in Computer Science, vol 181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13883-8_80
Download citation
DOI: https://doi.org/10.1007/3-540-13883-8_80
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13883-9
Online ISBN: 978-3-540-39087-9
eBook Packages: Springer Book Archive