Covering points with convex sets of minimum size

DOI10.1016/j.tcs.2016.11.014zbMath1395.68281OpenAlexW2549642977MaRDI QIDQ1705773

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

Publication date: 16 March 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.11.014

zbMATH Keywords

areaconvex setscomputational geometryconvex hullsperimetercovering points

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (1)

Minimum perimeter-sum partitions in the plane

Cites Work

• Unnamed Item
• 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
• Finding minimum area \(k\)-gons
• Minimizing the sum of diameters efficiently
• 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
• Finding tailored partitions
• Geometric clusterings
• Summarizing spatial data streams using ClusterHulls

This page was built for publication: Covering points with convex sets of minimum size