Abstract
Let\(\mathcal{O}\) be some set of orientations, that is,\(\mathcal{O} \subseteq [0^\circ ,360^\circ ]\). We consider the consequences of defining visibility based on curves that are monotone with respect to the orientations in\(\mathcal{O}\). We call such curves\(\mathcal{O}\)-staircases. Two points p andq in a polygonP are said to\(\mathcal{O}\)-see each other if an\(\mathcal{O}\)-staircase fromp toq exists that is completely contained inP. The\(\mathcal{O}\) -kernel of a polygonP is then the set of all points which\(\mathcal{O}\)-see all other points. The\(\mathcal{O}\)-kernel of a simple polygon can be obtained as the intersection of all {θ}-kernels, with θ∈\(\mathcal{O}\). With the help of this observation we are able to develop an\(O(n\log \left| \mathcal{O} \right|)\) algorithm to compute the\(\mathcal{O}\)-kernel of a simple polygon, for finite\(\mathcal{O}\). We also show how to compute theexternal \(\mathcal{O}\) -kernel of a polygon in optimal time\(O(n + \left| \mathcal{O} \right|)\). The two algorithms are combined to compute the (\(\mathcal{O}\)-kernel of a polygon with holes in time\(O(n^2 + n\left| \mathcal{O} \right|)\).
Similar content being viewed by others
References
M. Ben-Or. Lower bounds for algebraic computation trees.Proc. 15th ACM Symp. on Theory of Computing, 1983, pp. 80–86.
B. Bhattachara and H. El Gindy. A new linear convex hull algorithm for simple polygons.IEEE Transactions on Information Theory, 30:85–88, 1984.
B. Chazelle and H. Edelsbrunner. An optimal algorithm to intersect line segments in the plane.Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp. 590–600.
R. Cole and M. Goodrich. Optimal parallel algorithms for polygon and point-set problems.Proc. 4th ACM Symp. on Computational Geometry, 1988, pp. 201–210.
J. Culberson and R. Reckhow. A Unified Approach to Orthogonal Polygon Covering Problems via Dent Diagrams. Technical Report TR 89-6, Department of Computing Science, University of Alberta, 1989.
H. Edelsbrunner.Algorithms in Combinatorial Geometry. Springer-Verlag, New York, 1987.
L. Gewali and S. Ntafos. Minimum covers for grids and orthogonal polygons by periscope guards. In Jorge Urrutia, editor,Proc. 2nd Canadian Conf. on Computational Geometry, University of Ottawa, 1990, pp. 358–361.
R. Graham and F. Yao. Finding the convex hull of a simple polygon.Journal of Algorithms, 4:324–331, 1983.
J. Keil. Minimally covering a horizontally convex polygon.Proc. 2nd ACM Symp. on Computational Geometry, 1986, pp. 43–51.
D. Kirkpatrick and R. Seidel. The ultimate planar convex hull algorithm.SIAM Journal of Computing, 12(1):287–299, 1986.
D. Lee. On finding the convex hull of a simple polygon.International Journal of Computer and Information Sciences, 12:87–99, 1983.
D. Lee and F. Preparata. An optimal algorithm for finding the kernel of a polygon.Journal of the ACM, 26(3):415–421, 1979.
D. McCallum and D. Avis. A linear algorithm for finding the convex hull of a simple polygon.Information Processing Letters, 9:201–206, 1979.
I. Munro, M. Overmars, and D. Wood. Variations on visibility.Proc. 3rd ACM Symp. on Computational Geometry, 1987, pp. 291–299.
R. Motwani, A. Raghunathan, and H. Saran. Covering orthogonal polygons with star polygons: the perfect graph approach.Proc. 4th ACM Symp. on Computational Geometry, 1988, pp. 211–223.
R. Motwani, A. Raghunathan, and H. Saran. Perfect graphs and orthogonally convex covers.Proc. 4th SIAM Conference on Discrete Mathematics, 1988.
T. Nicholl, D. Lee, Y. Liao, and C. Wong. Constructing thex-y convex hull of a set ofx-y convex polygons.BIT, 23:456–471, 1983.
Th. Ottmann and P. Widmayer.Algorithmen und Datenstrukturen. BI Wissenschaftsverlag, 1990.
M. Overmars and D. Wood. On rectangular visibility.Journal of Algorithms, 9:372–390, 1988.
F. Preparata and M. Shamos.Computational Geometry—an Introduction. Springer-Verlag New York, 1985.
G. Rawlins. Explorations in Restricted-Orientation Geometry. Ph.D. thesis, University of Waterloo, 1987.
R. Reckhow and J. Culberson. Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons.Proc. 3rd ACM Symp. on Computational Geometry, 1987, pp. 268–277.
G. Rawlins and D. Wood. On the optimal computation of finitely-oriented convex hulls.Information and Computation, 72:150–166, 1987.
G. Rawlins and D. Wood. Computational geometry with restricted orientations.Proc. 13th IFIP Conf. on System Modelling and Optimization, 1988.
G. Rawlins and D. Wood. Ortho-convexity and its generalizations. In G. Toussaint, editor,Computational Morphology, Elsevier (North-Holland), Amsterdam, 1988, pp. 137–152.
R. Schneider. Convex geometry. Script to lecture, 1989.
S. Schuierer and D. Wood. Restricted Orientation Visibility. Technical Report 40, Inst. für Informatik, Universität Freiburg, 1991.
S. Schuierer and D. Wood. Visibility in Semi-Convex Spaces. Technical Report 37, Inst. für Informatik, Universität Freiburg, 1991.
D. Wood and C. Yap. The orthogonal convex skull problem.Discrete & Computational Geometry, 3(4): 349–365, 1988.
A. Yao. Lower-bounds for algebraic computation trees with integer inputs.Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, pp. 308–313.
Author information
Authors and Affiliations
Additional information
Communicated by K. Mehlhorn.
This work was supported by the Deutsche Forschungsgemeinschaft under Grant No. Ot 64/5-4 and the Natural Sciences and Engineering Research Council of Canada and Information Technology Research Centre of Ontario.
Rights and permissions
About this article
Cite this article
Schuierer, S., Wood, D. Staircase visibility and computation of kernels. Algorithmica 14, 1–26 (1995). https://doi.org/10.1007/BF01300371
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01300371