Covering Points with Convex Sets of Minimum Size

DOI10.1007/978-3-319-30139-6_14zbMath1475.68405OpenAlexW2503805086MaRDI QIDQ2803821

Hwan-Gue Cho, Chan-Su Shin, Noushin Saeedi, William S. Evans

Publication date: 3 May 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-30139-6_14

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Covering a set of points by two axis-parallel boxes
• Largest and smallest convex hulls for imprecise points
• Covering a set of points in a plane using two parallel rectangles
• Maintenance of configurations in the plane
• Finding minimum area \(k\)-gons
• The exact fitting problem in higher dimensions
• More planar two-center algorithms
• On intersecting a set of parallel line segments with a convex polygon of minimum area
• Constructing Street Networks from GPS Trajectories
• COVERING A POINT SET BY TWO DISJOINT RECTANGLES
• Finding k points with minimum diameter and related problems
• Map Construction Algorithms
• Off-Line Maintenance of Planar Configurations
• Summarizing spatial data streams using ClusterHulls

This page was built for publication: Covering Points with Convex Sets of Minimum Size