- Full text PDF available (3)
- This year (0)
- Last 5 years (1)
- Last 10 years (3)
Journals and Conferences
Let P be a set of n points in the plane. We solve the problem of computing the orientations for which the rectilinear convex hull of P has minimum area in optimal ⇥(n log n) time and O(n) space.
This paper describes a system to enable access to those information systems at the National Autonomous University of Mexico that are related to biodiversity and the environment. This system associates existing Geographic Information Systems, Biodiversity Information Systems, and standard Relational Database Management Systems in a federation. In this way,… (More)
We study the O β-hull of a planar point set, a generalization of the Orthogonal Convex Hull where the coordinate axes form an angle β. Given a set P of n points in the plane, we show how to maintain the O β-hull of P while β runs from 0 to π in Θ(n log n) time and O(n) space. With the same complexity, we also find the values of β that maximize the area and… (More)