A Hough Transform Approach to Solving Linear Min-Max Problems
Carmi Grushko
TL;DR
This paper introduces a Hough Transform-based algorithm for efficiently solving 2D linear min-max problems, outperforming existing solvers in speed and stability.
Contribution
It presents a novel Hough Transform approach for 2D linear min-max problems, demonstrating improved performance over standard solvers.
Findings
The proposed algorithm is faster than CGAL's linear programming solver.
The algorithm offers greater numerical stability.
It effectively solves 2D linear min-max problems in fewer constraints.
Abstract
Several ways to accelerate the solution of 2D/3D linear min-max problems in constraints are discussed. We also present an algorithm for solving such problems in the 2D case, which is superior to CGAL's linear programming solver, both in performance and in stability.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsImage and Object Detection Techniques · Computational Geometry and Mesh Generation · Vehicle License Plate Recognition