Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)

DOI10.4230/LIPICS.SOCG.2020.83OpenAlexW3037875248MaRDI QIDQ6060047

Dawei Zheng, Unnamed Author, Jack Spalding-Jamieson

Publication date: 2 November 2023

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12241/pdf/LIPIcs-SoCG-2020-83.pdf/

zbMATH Keywords

planar point setsconvex partitionrandomized local search

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Complexity and performance of numerical algorithms (65Y20) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

This page was built for publication: Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)