文章基本信息

标题：Geometric Secluded Paths and Planar Satisfiability
本地全文：下载
作者：Kevin Buchin ; Valentin Polishchuk ; Leonid Sedov 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2020
卷号：164
页码：24:1-24:15
DOI：10.4230/LIPIcs.SoCG.2020.24
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We consider paths with low exposure to a 2D polygonal domain, i.e., paths which are seen as little as possible; we differentiate between integral exposure (when we care about 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 connections of the problem to minimum satisfiability and settle hardness of variants of planar min- and max-SAT.
关键词：Visibility; Route planning; Security/privacy; Planar satisfiability