A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions
2020
International Symposium on Computational Geometry
Our work on minimum convex decompositions is based on two key components: (1) different strategies for computing initial decompositions, partly adapted to the characteristics of the input data, and (2) local optimizations for reducing the number of convex faces of a decomposition. We discuss our main heuristics and show how they helped to reduce the face count.
doi:10.4230/lipics.socg.2020.85
dblp:conf/compgeom/EderHLP20
fatcat:wwchje4rq5e3rmkj756avatty4