pdf-format: |
|
@InProceedings{zheng_et_al:LIPIcs:2020:12241, author = {Da Wei Zheng and Jack Spalding-Jamieson and Brandon Zhang}, title = {{Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {83:1--83:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Sergio Cabello and Danny Z. Chen}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12241}, URN = {urn:nbn:de:0030-drops-122412}, doi = {10.4230/LIPIcs.SoCG.2020.83}, annote = {Keywords: convex partition, randomized local search, planar point sets} }
Keywords: | convex partition, randomized local search, planar point sets | |
Seminar: | 36th International Symposium on Computational Geometry (SoCG 2020) | |
Issue date: | 2020 | |
Date of publication: | 08.06.2020 |