Elsevier

Information Sciences

Volume 33, Issue 3, September 1984, Pages 157-171
Information Sciences

On the definition and computation of rectilinear convex hulls

https://doi.org/10.1016/0020-0255(84)90025-2Get rights and content

Abstract

Recently the computation of the rectilinear convex hull of a collection of rectilinear polygons has been studied by a number of authors. From these studies three distinct definitions of rectilinear convex hulls have emerged. We examine these three definitions for point sets in general, pointing out some of their consequences, and we give optimal algorithms to compute the corresponding rectilinear convex hulls of a finite set of points in the plane.

References (14)

  • M.H. Overmars et al.

    Maintenance of configurations in the plane

    J. Comput. System Sci.

    (1981)
  • J.L. Bentley

    Multidimensional divide-and-conquer

    Comm. ACM

    (1980)
  • B. Grünbaum

    Convex Polytopes

    (1967)
  • H. Hadwiger et al.

    Combinatorial Geometry in the Plane

    (1964)
  • D.G. Kirkpatrick et al.

    The ultimate planar convex hull algorithm

  • D. G. Kirkpatrick and R. Seidel, An O(n log h) algorithm for computing a staircase, to...
  • D. G. Kirkpatrick and R. Seidel, An O(n log h) algorithm for computing a three-dimensional staircase, to...
There are more references available in the full text version of this article.

Cited by (67)

  • Set-valued games and mixed-strategy equilibria in discounted supergames

    2019, Discrete Applied Mathematics
    Citation Excerpt :

    We note that this is not the standard definition since these sets need not be connected in general. These sets are also called rectilinear convex, orthogonal convex, or restricted-orientation convex [23,31,32]. The monotonicity guarantees that the extrema are found in the extreme points of the X-Y convex sets.

  • On the O<inf>β</inf>-hull of a planar point set

    2018, Computational Geometry: Theory and Applications
  • Separability of imprecise points

    2017, Computational Geometry: Theory and Applications
  • Covering points with minimum/maximum area orthogonally convex polygons

    2016, Computational Geometry: Theory and Applications
    Citation Excerpt :

    It can be employed, for instance, in constructing 2D floor layouts with area constraints, and also as a finer grain substitute for bounding boxes of graphical objects as well as being theoretically interesting in its own right. As stated in [9], orthogonal convex hulls, studied in [10], may be disconnected or degenerate. The orthogonally convex cover, however, is a balanced representation and may be useful where the bounding box is too simple and the orthogonal convex hull is disconnected.

View all citing articles on Scopus

The work of the second author was supported partially by the Academy of Finland and partially by the Alexander von Humboldt Foundation, while that of the third author was supported under Natural Sciences and Engineering Research Council of Canada Grant No. A-5692.

View full text