Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022

Q2 Mathematics

Journal of Experimental Algorithmics Pub Date : 2022-03-14 DOI:10.1145/3604907

S. Fekete, Phillip Keldenich, Dominik Krupke, S. Schirra

引用次数: 6

Abstract

We give an overview of the 2022 Computational Geometry Challenge targeting the problem Minimum Partition into Plane Subsets, which consists of partitioning a given set of line segments into a minimum number of non-crossing subsets.

查看原文本刊更多论文

最小分割到平面子图:CG:SHOP挑战2022

我们概述了2022年计算几何挑战赛的目标是将问题最小划分为平面子集，该问题包括将给定的线段集划分为最小数量的非交叉子集。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Experimental Algorithmics Mathematics-Theoretical Computer Science

CiteScore

3.10

自引率

0.00%

发文量

期刊介绍： The ACM JEA is a high-quality, refereed, archival journal devoted to the study of discrete algorithms and data structures through a combination of experimentation and classical analysis and design techniques. It focuses on the following areas in algorithms and data structures: ■combinatorial optimization ■computational biology ■computational geometry ■graph manipulation ■graphics ■heuristics ■network design ■parallel processing ■routing and scheduling ■searching and sorting ■VLSI design