Minkowski Sum Selection and Finding

DOI10.1007/978-3-540-92182-0_42zbMATH Open1183.68723OpenAlexW1808128756MaRDI QIDQ3596741FDOQ3596741

Authors: Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao 

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_42

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
• A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets
• Minimizing the sum of the \(k\) largest functions in linear time.

zbMATH Keywords

bioinformaticssequence analysisMinkowski sum

Mathematics Subject Classification ID

Randomized algorithms (68W20) Nonnumerical algorithms (68W05)

Cited In (2)

• Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently
• Minkowski sum selection and finding

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 Q3596741)