Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares
verfasst von : Wenqi Ju, Jun Luo
Erschienen in: Frontiers in Algorithmics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Given a set of
n
equal size and non-overlapping axis-aligned squares, we need to choose exactly one point in each square to make the area of a convex hull of the resulting point set as large as possible. Previous algorithm [10] on this problem gives an optimal algorithm with
O
(
n
3
) running time. In this paper, we propose an approximation algorithm which runs in
O
(
n
log
n
) time and gives a convex hull with area larger than the area of the optimal convex hull minus the area of one square.