Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge) - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Laurent Moalic, Dominique Schmitt, Julien Lepagnot, Julien Kritter. Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge). In Sergio Cabello, Danny Z. Chen, editors, 36th International Symposium on Computational Geometry, SoCG 2020, June 23-26, 2020, Zürich, Switzerland. Volume 164 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

This author has not been identified. Look up 'Laurent Moalic' in GoogleThis author has not been identified. Look up 'Dominique Schmitt' in GoogleThis author has not been identified. Look up 'Julien Lepagnot' in GoogleThis author has not been identified. Look up 'Julien Kritter' in Google

runs on WebDSL