Minkowski sum selection and finding
From MaRDI portal
Publication:3089093
DOI10.1142/S0218195911003664zbMATH Open1228.65090MaRDI QIDQ3089093FDOQ3089093
Authors: Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao 
Publication date: 23 August 2011
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Recommendations
- Minkowski Sum Selection and Finding
- On the largest convex subsets in Minkowski sums
- Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently
- Minkowski set operations and their applications.
- Convexly independent subsets of Minkowski sums of convex polygons
Cites Work
- Introduction to algorithms
- Generalized Selection and Ranking: Sorted Matrices
- Randomized optimal algorithm for slope selection
- A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
- An Optimal-Time Algorithm for Slope Selection
- Fast algorithms for the density finding problem
- Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
- Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
- Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
- Efficient algorithms for \(k\) maximum sums
- Randomized algorithm for the sum selection problem
- Efficient randomized algorithms for the repeated median line estimator
Cited In (4)
This page was built for publication: Minkowski sum selection and finding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089093)
