Work

The Partition Spanning Forest Problem

Year: 2018

Type: preprint

Abstract: Given a set of colored points in the plane, we ask if there exists a crossing-free straight-line drawing of a spanning forest, such that every tree in the forest contains exactly the points of one color class. We show that the problem is NP-complete, even if every color class contains at most five points, but it is solvable in $O(n^2)$ time when each color class contains at most three points. If we require that the spanning forest is a linear forest, then the problem becomes NP-complete even if every color class contains at most four points.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1809.02710

Authors: Kindermann, Philipp, Klemz, Boris, Rutter, Ignaz, Schnider, Patrick, Schulz, André

Institutions: University of Waterloo, Freie Universität Berlin, University of Passau, ETH Zurich, FernUniversität in Hagen

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: John Templeton Foundation

OpenAlex ID: W2892261985

Cites: 5

Cited by: 12

Related to: 20