Finding the maximum bounded intersection of k out of n halfplanes

DOI10.1016/J.IPL.2009.11.003MaRDI QIDQ990126zbMATH OpenOpenAlexFDO

Authors Peter Brass, Hyeon-Suk Na

Publication date 2 September 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2009.11.003

zbMATH Keywords

algorithmscomputational geometrymaximum intersection

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• An optimal algorithm for finding minimal enclosing triangles
• Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
• Finding Extremal Polygons
• Finding the smallest triangles containing a given convex polygon
• Minimum area circumscribing polygons

This page was built for publication: Finding the maximum bounded intersection of \(k\) out of \(n\) halfplanes

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