Shadoks approach to minimum partition into plane subgraphs (CG challenge)

DOI10.4230/LIPICS.SOCG.2022.71MaRDI QIDQ6539583FDOQ6539583

Authors: Loïc Crombez, Guilherme D. Da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo 

Publication date: 14 May 2024

Recommendations

• SAT-based local search for plane subgraph partitions (CG challenge)
• Conflict-based local search for minimum partition into plane subgraphs (CG challenge)
• Shadoks approach to convex covering (CG challenge)
• Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)
• Local search with weighting schemes for the CG:SHOP 2022 competition (CG challenge)

zbMATH Keywords

computational geometrygraph coloringintersection graphline segmentsplane graphsconflict optimizer

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (6)

• Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
• SAT-boosted tabu search for coloring massive graphs
• Shadoks approach to convex covering (CG challenge)
• Conflict-based local search for minimum partition into plane subgraphs (CG challenge)
• Local search with weighting schemes for the CG:SHOP 2022 competition (CG challenge)
• SAT-based local search for plane subgraph partitions (CG challenge)

This page was built for publication: Shadoks approach to minimum partition into plane subgraphs (CG challenge)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6539583)