On minimum-area hulls
From MaRDI portal
Recommendations
Cited in
(19)- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
- A practical but rigorous approach to sum-of-ratios optimization in geometric applications
- An effective computational algorithm for the global solution of a class of linear fractional programming
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
- Hausdorff approximation of convex polygons
- scientific article; zbMATH DE number 4206037 (Why is no real title available?)
- A note on Hulls
- On minimum-area hulls (extended abstract)
- OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
- TOPOLOGICAL PEELING AND APPLICATIONS
- scientific article; zbMATH DE number 778197 (Why is no real title available?)
- The Statistical Face of a Region Under Monsoon Rainfall in Eastern India
- Geodesic-preserving polygon simplification
- Peeling meshed potatoes
- Geometric optimization and sums of algebraic functions
- Efficient algorithms for Battleship
- Deterministic 3SUM-hardness
- A new global optimization method based on separable relaxation for solving sum of linear ratios problem
- Computing minimum-area rectilinear convex hull and L-shape
This page was built for publication: On minimum-area hulls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386468)