> Details

Crombez, Loïc [Author]; da Fonseca, Guilherme D. [Author]; Gerard, Yan [Author]; Gonzalez-Lorenzo, Aldo [Author] ; Loïc Crombez and Guilherme D. da Fonseca and Yan Gerard and Aldo Gonzalez-Lorenzo [Contributor]

Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge)

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: Text; Electronic Conference Proceeding; E-Article
  • Title: Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge)
  • Contributor: Crombez, Loïc [Author]; da Fonseca, Guilherme D. [Author]; Gerard, Yan [Author]; Gonzalez-Lorenzo, Aldo [Author]
  • imprint: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
  • Language: English
  • DOI: https://doi.org/10.4230/LIPIcs.SoCG.2022.71
  • Keywords: computational geometry ; intersection graph ; conflict optimizer ; line segments ; graph coloring ; Plane graphs
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: We explain the heuristics used by the Shadoks team to win first place in the CG:SHOP 2022 challenge that considers the minimum partition into plane subgraphs. The goal is to partition a set of segments into as few subsets as possible such that segments in the same subset do not cross each other. The challenge has given 225 instances containing between 2500 and 75000 segments. For every instance, our solution was the best among all 32 participating teams.
  • Access State: Open Access