EconPapers    
Economics at your fingertips  
 

Largest area convex hull of imprecise data based on axis-aligned squares

Wenqi Ju (), Jun Luo (), Binhai Zhu () and Ovidiu Daescu ()
Additional contact information
Wenqi Ju: Chinese Academy of Sciences
Jun Luo: Chinese Academy of Sciences
Binhai Zhu: Montana State University
Ovidiu Daescu: University of Texas at Dallas

Journal of Combinatorial Optimization, 2013, vol. 26, issue 4, No 14, 832-859

Abstract: Abstract In recent years, more and more algorithms related to imprecise data have been proposed. Specifically, some algorithms on computing the maximum area convex hull are designed recently when the imprecise data are modeled as non-overlapping axis-aligned squares or as equal size squares. The time complexity of the best known algorithm based on non-overlapping axis-aligned squares is O(n 7). If the squares have equal size and can overlap, the time complexity of the best known algorithm is O(n 5). In this paper, we improve the former from O(n 7) to O(n 5) and improve the latter from O(n 5) to O(n 2). These results are obtained by exploiting the non-trivial geometric properties of the problems.

Keywords: Imprecise data; Computational geometry; Convex hull (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9488-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:26:y:2013:i:4:d:10.1007_s10878-012-9488-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9488-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:26:y:2013:i:4:d:10.1007_s10878-012-9488-5