2000 character limit reached
Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020
Published 8 Apr 2020 in cs.CG | (2004.04207v1)
Abstract: We give an overview of the 2020 Computational Geometry Challenge, which targeted the problem of partitioning the convex hull of a given planar point set P into the smallest number of convex faces, such that no point of P is contained in the interior of a face.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.