Linking disjoint axis-parallel segments into a simple polygon is hard too

09/05/2021
by   Rain Jiang, et al.
0

Deciding whether a family of disjoint axis-parallel line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/29/2021

Linking disjoint segments into a simple polygon is hard

Deciding whether a family of disjoint line segments in the plane can be ...
research
09/06/2021

Disjoint axis-parallel segments without a circumscribing polygon

We construct a family of 17 disjoint axis-parallel line segments in the ...
research
09/26/2018

Convex partial transversals of planar regions

We consider the problem of testing, for a given set of planar regions R...
research
06/18/2021

Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls

In this study, a geometric version of an NP-hard problem ("Almost 2-SAT"...
research
06/22/2022

Reflections in an octagonal mirror maze

Suppose we are given an environment consisting of axis-parallel and diag...
research
04/20/2021

Finding Geometric Representations of Apex Graphs is NP-Hard

Planar graphs can be represented as intersection graphs of different typ...

Please sign up or login with your details

Forgot password? Click here to reset