منابع مشابه
Minimum-link paths revisited
A path or a polygonal domain is C-oriented if the orientations of its edges belong to a set of C given orientations; this is a generalization of the notable rectilinear case (C = 2). We study exact and approximation algorithms for minimum-link C-oriented paths and paths with unrestricted orientations, both in C-oriented and in general domains. We obtain the following results: • An optimal algor...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملScalable Isocontour Visualization in Road Networks via Minimum-Link Paths
Isocontours in road networks represent the area that is reachable from a source within a given resource limit. We study the problem of computing accurate isocontours in realistic, large-scale networks. We propose polygons with minimum number of segments that separate reachable and unreachable components of the network. Since the resulting problem is not known to be solvable in polynomial time, ...
متن کاملApproximating Polygons and Subdivisions with Minimum Link Paths
A linear time algorithm for minimum link paths inside a simple polygon. Algorithms for the reduction of the number of points required to represent a line or its caricature. Computing the visibility polygon from a convex set and related problems. implementation of the Douglas-Peucker line simpli-cation algorithm using at most cn log n operations. In preparation, 1991. 16] H. Imai and M. Iri. Com...
متن کاملSELinux Protected Paths Revisited
We revisit the notion of achieving a protected communication path for applications connected via the Internet using SELinux. Last year, we discussed the mechanism for integrating IPsec with SELinux security labels, but we did not consider the system goals for using such labels. Toward this end, we revisit early SELinux proposals for what is called a protected path. A protected path is a secure ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2014
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2013.12.005