Planar maximum-box problem revisited

DOI10.1016/J.TCS.2017.12.038MaRDI QIDQ1749536zbMATH OpenOpenAlexFDO

Authors 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

computational geometrydiscrete optimizationplane sweep algorithms

Mathematics Subject Classification ID

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

Recommendations

• Planar maximum box problem
• The maximum box problem for moving points in the plane
• Maximum-weight planar boxes in \(O(n^2)\) time (and better)
• Maximum box problem on stochastic points
• Maximum box problem on stochastic points
• Planar packings and mappings related to certain minmax problems
• On the maximum empty rectangle problem
• Algorithm Theory - SWAT 2004
• The maximum box problem and its application to data analysis

Cites work

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

Cited in

(10)

• Maximum box problem on stochastic points
• Maximum box problem on stochastic points
• Planar maximum box problem
• Maximum-weight planar boxes in \(O(n^2)\) time (and better)
• The maximum box problem and its application to data analysis
• The maximum box problem for moving points in the plane
• The class cover problem with boxes
• Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms
• Bichromatic separability with two boxes: A general approach
• Variations of largest rectangle recognition amidst a bichromatic point set

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749536)