AI Chat AI Image Generator AI Video Text to Speech

Rectilinear Convex Hull of Points in 3D

09/13/2022

∙

by Pablo Pérez-Lantero, et al.

∙

∙

Let P be a set of n points in ℝ^3 in general position, and let RCH(P) be the rectilinear convex hull of P. In this paper we obtain an optimal O(nlog n)-time and O(n)-space algorithm to compute RCH(P). We also obtain an efficient O(nlog^2 n)-time and O(nlog n)-space algorithm to compute and maintain the set of vertices of the rectilinear convex hull of P as we rotate ℝ^3 around the z-axis. Finally we study some properties of the rectilinear convex hulls of point sets in ℝ^3.

Pablo Pérez-Lantero
11 publications
Carlos Seara
13 publications
Jorge Urrutia
13 publications

research

∙ 10/30/2017

Rectilinear and O-convex hull with minimum area

Let P be a set of n points in the plane and O be a set of k lines passin...

0 Carlos Alegría-Galicia, et al. ∙

research

∙ 03/02/2021

On Optimal w-gons in Convex Polygons

Let P be a set of n points in ℝ^2. For a given positive integer w<n, our...

0 Vahideh Keikha, et al. ∙

research

∙ 11/06/2018

The Set-Maxima Problem in a Geometric Setting

In this paper we look at the classical set-maxima problem. We give a new...

0 Indranil Banerjee, et al. ∙

research

∙ 02/12/2020

Computing Shapley Values for Mean Width in 3-D

The Shapley value is a common tool in game theory to evaluate the import...

0 Shuhao Tan, et al. ∙

research

∙ 09/09/2022

Separating bichromatic point sets in the plane by restricted orientation convex hulls

We explore the separability of point sets in the plane by a restricted-o...

0 Carlos Alegría, et al. ∙

research

∙ 07/17/2019

Maximum rectilinear convex subsets

Let P be a set of n points in the plane. We consider a variation of the ...

0 Hernán González-Aguilar, et al. ∙

research

∙ 07/19/2019

Favourite distances in 3-space

Let S be a set of n points in Euclidean 3-space. Assign to each x∈ S a d...

0 Konrad J. Swanepoel, et al. ∙