Abstract
Let P be a set of n points in R3 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(nlog2n) -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 R3 around the z-axis. Finally we study some properties of the rectilinear convex hulls of point sets in R3.
Cite
CITATION STYLE
Pérez-Lantero, P., Seara, C., & Urrutia, J. (2020). Rectilinear Convex Hull of Points in 3D. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12118 LNCS, pp. 296–307). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-61792-9_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
