Largest convex hulls for constant size, convex-hull disjoint clusters

DOI10.1007/978-3-031-20350-3_12OpenAlexW4313349122MaRDI QIDQ6111951

No author found.

Publication date: 4 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-20350-3_12

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Largest area convex hull of imprecise data based on axis-aligned squares
• New results on stabbing segments with a polygon
• Largest and smallest convex hulls for imprecise points
• Structural tolerance and Delaunay triangulation
• Constructing strongly convex approximate hulls with inaccurate primitives
• Touring a sequence of polygons

This page was built for publication: Largest convex hulls for constant size, convex-hull disjoint clusters