Rectilinear Convex Hull with minimum area
Computational Geometry
2017-12-29 v2
Abstract
Let be a planar set of points in general position. We consider the problem of computing an orientation of the plane for which the Rectilinear Convex Hull of has minimum area. Bae et al. (Computational Geometry: Theory and Applications, Vol. 42, 2009) solved the problem in quadratic time and linear space. We describe an algorithm that reduces this time complexity to .
Cite
@article{arxiv.1509.02627,
title = {Rectilinear Convex Hull with minimum area},
author = {Carlos Alegría-Galicia and Tzolkin Garduño and Carlos Seara and Areli Rosas-Navarrete and Jorge Urrutia},
journal= {arXiv preprint arXiv:1509.02627},
year = {2017}
}