Planar maximum-box problem revisited

DOI10.1016/j.tcs.2017.12.038zbMath1390.68730OpenAlexW2782456515MaRDI QIDQ1749536

Farnaz Sheikhi, Ali Mohades

Publication date: 17 May 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.12.038

zbMATH Keywords

discrete optimizationcomputational geometryplane sweep algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms

Cites Work

• Unnamed Item
• The maximum box problem for moving points in the plane
• The maximum box problem and its application to data analysis
• Planar maximum box problem
• Pareto-optimal patterns in logical analysis of data
• Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
• Maximum-weight planar boxes in \(O(n^2)\) time (and better)
• The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
• Largest empty rectangle among a point set
• Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations

This page was built for publication: Planar maximum-box problem revisited