Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions (CG Challenge)

Held, Martin
de Lorenzo, Stefan
Palfrader, Peter

Publication date

January 2020

DOI

10.4230/LIPIcs.SoCG.2020.85

Publisher

LIPIcs - Leibniz International Proceedings in Informatics. 36th International Symposium on Computational Geometry (SoCG 2020)

Abstract

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

Extracted data

We use cookies to provide a better user experience.

Data Protection

Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions (CG Challenge)

Abstract

Extracted data

Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions (CG Challenge)

Abstract

Extracted data

Related items

Related items