Finding the maximum bounded intersection of k out of n halfplanes

DOI10.1016/J.IPL.2009.11.003zbMATH Open1206.68318OpenAlexW2062853773MaRDI QIDQ990126FDOQ990126

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

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

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)