On the definition and computation of rectilinear convex hulls
type: Item
instance of: scholarly article
title: On the definition and computation of rectilinear convex hulls
zbMATH Open document ID: 0558.68061
DOI: 10.1016/0020-0255(84)90025-2
author: Thomas Ottmann
author: Eljas Soisalon-Soininen
author: D. Wood
published in: Information Sciences
publication date: 1984-01-01T00:00:00Z
review text: Unlike the classical convex hull, the definition of the rectilinear convex hull of a collection of points or of a collection of (rectilinear) polygons is fraught with difficulties. In this note three different approaches are discussed which have appeared in the literature. The three definitions are examined for point sets in general and some of their consequences are pointed out. Furthermore, optimal algorithms to compute the corresponding rectilinear convex hulls of a finite set of points in the plane are developed.
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 52A10
zbMATH DE Number: 3890753
zbMATH Keywords: computational geometry
zbMATH Keywords: algorithms
MaRDI profile type: Publication
full work available at URL: 0020-0255(84)90025-2
OpenAlex ID: W1966720998
cites work: Multidimensional divide-and-conquer
cites work: Q5547252
cites work: On Finding the Maxima of a Set of Vectors
cites work: On the X-Y convex hull of a set of X-Y polygons
cites work: The design of dynamic data structures
cites work: Maintenance of configurations in the plane
cites work: Q3992847
description: scientific article; zbMATH DE number 3890753