DeepAI
Log In Sign Up

Removing Connected Obstacles in the Plane is FPT

02/04/2020
by   Eduard Eiben, et al.
0

Given two points in the plane, a set of obstacles defined by closed curves, and an integer k, does there exist a path between the two designated points intersecting at most k of the obstacles? This is a fundamental and well-studied problem arising naturally in computational geometry, graph theory, wireless computing, and motion planning. It remains NP-hard even when the obstacles are very simple geometric shapes (e.g., unit-length line segments). In this paper, we show that the problem is fixed-parameter tractable (FPT) parameterized by k, by giving an algorithm with running time k^O(k^3)n^O(1). Here n is the number connected areas in the plane drawing of all the obstacles.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/29/2020

A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane

Given two points s and t in the plane and a set of obstacles defined by ...
12/11/2017

How to navigate through obstacles?

Given a set of obstacles and two points, is there a path between the two...
07/22/2011

Computing the obstacle number of a plane graph

An obstacle representation of a plane graph G is V(G) together with a se...
06/30/2022

Bounding and computing obstacle numbers of graphs

An obstacle representation of a graph G consists of a set of pairwise di...
09/02/2020

Turning machines

Molecular robotics is challenging, so it seems best to keep it simple. W...
03/15/2022

Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles

Suppose we are given a pair of points s, t and a set S of n geometric ob...
11/17/2021

Barrier Forming: Separating Polygonal Sets with Minimum Number of Lines

In this work, we carry out structural and algorithmic studies of a probl...