Minimum-link C-Oriented Paths Visiting a Sequence of Regions in the Plane

02/14/2023
by   Kerem Geva, et al.
0

Let E={e_1,…,e_n} be a set of C-oriented disjoint segments in the plane, where C is a given finite set of orientations that spans the plane, and let s and t be two points. in C, its opposite orientation is also in C.) We seek a minimum-link C-oriented tour of E, that is, a polygonal path π from s to t that visits the segments of E in order, such that, the orientations of its edges are in C and their number is minimum. We present an algorithm for computing such a tour in O(|C|^2 · n^2) time. This problem already captures most of the difficulties occurring in the study of the more general problem, in which E is a set of not-necessarily-disjoint C-oriented polygons.

READ FULL TEXT

page 13

page 19

page 20

research
08/16/2022

Computing Smallest Convex Intersecting Polygons

A polygon C is an intersecting polygon for a set O of objects in the pla...
research
04/03/2018

The exact chromatic number of the convex segment disjointness graph

Let P be a set of n points in strictly convex position in the plane. Let...
research
07/21/2021

Separating Colored Points with Minimum Number of Rectangles

In this paper we study the following problem: Given k disjoint sets of p...
research
09/29/2022

Minimum Link Fencing

We study a variant of the geometric multicut problem, where we are given...
research
09/12/2021

Caterpillars and alternating paths

Let p(m) (respectively, q(m)) be the maximum number k such that any tree...
research
03/14/2022

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

We give an overview of the 2022 Computational Geometry Challenge targeti...
research
05/20/2020

Further Questions on Oriented Convex Containers of Convex Planar Regions

We define an 'oriented convex region' as a convex region with a directio...

Please sign up or login with your details

Forgot password? Click here to reset