Login / Signup
Covering points with minimum/maximum area orthogonally convex polygons.
Cem Evrendilek
Burkay Genç
Brahim Hnich
Published in:
Comput. Geom. (2016)
Keyphrases
</>
convex hull
simple polygon
minimum distance
point sets
minkowski sum
maximum distance
digital convexity
endpoints
computational geometry
data points
discrete geometry
data sets
three dimensional
medial axis
convex polyhedra