Geometric secluded paths and planar satisfiability

02/18/2019
by   Valentin Polishchuk, et al.
0

We consider paths with low "exposure" to a polygonal domain, i.e., paths which are seen as little as possible; we differentiate between "integral" exposure (when we care for how long the path sees every point of the domain) and "0/1" exposure (just counting whether a point is seen by the path or not). For the integral exposure, we give a PTAS for finding the minimum-exposure path between two given points in the domain; for the 0/1 version, we prove that in a simple polygon the shortest path has the minimum exposure, while in domains with holes the problem becomes NP-hard. We also highlight connection of the problem to minimum satisfiability and settle hardness of variants of planar min- and max-SAT.

READ FULL TEXT
research
02/20/2022

Finding shortest non-separating and non-disconnecting paths

For a connected graph G = (V, E) and s, t ∈ V, a non-separating s-t path...
research
03/28/2020

Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons

We address the following problem: Given a simple polygon P with n vertic...
research
03/04/2021

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms

The purpose of this work is to introduce and characterize the Bounded Ac...
research
09/18/2018

Finding k-Dissimilar Paths with Minimum Collective Length

Shortest path computation is a fundamental problem in road networks. How...
research
07/10/2022

APX-Hardness of the Minimum Vision Points Problem

Placing a minimum number of guards on a given watchman route in a polygo...
research
09/06/2023

Narrative as a Dynamical System

There is increasing evidence that human activity in general, and narrati...
research
05/03/2019

Most vital segment barriers

We study continuous analogues of "vitality" for discrete network flows/p...

Please sign up or login with your details

Forgot password? Click here to reset