A linear time algorithm for minimum link paths inside a simple polygon
From MaRDI portal
Publication:3026389
DOI10.1016/0734-189X(86)90127-1zbMath0624.68101OpenAlexW2001513095MaRDI QIDQ3026389
Publication date: 1986
Published in: Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0734-189x(86)90127-1
Related Items
Computing minimum length paths of a given homotopy class ⋮ Minimal link visibility paths inside a simple polygon ⋮ Diffuse reflection diameter in simple polygons ⋮ The Complexity of Drawing a Graph in a Polygonal Region ⋮ Constructing pairwise disjoint paths with few links ⋮ Unnamed Item ⋮ Parallel algorithms for all minimum link paths and link center problems ⋮ Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons ⋮ A linear-time algorithm for constructing a circular visibility diagram ⋮ Optimal parallel algorithms for rectilinear link-distance problems ⋮ Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons ⋮ Separating two simple polygons by a sequence of translations ⋮ Efficient piecewise-linear function approximation using the uniform metric ⋮ Optimal on-line algorithms for walking with minimum number of turns in unknown streets ⋮ An O(n log n) algorithm for computing a link center in a simple polygon ⋮ Visibility with multiple diffuse reflections ⋮ Coloring polygon visibility graphs and their generalizations ⋮ Kinetic Geodesic Voronoi Diagrams in a Simple Polygon ⋮ Link distance and shortest path problems in the plane ⋮ Partitioning arrangements of lines. I: An efficient deterministic algorithm ⋮ Construction of \(\epsilon\)-nets ⋮ An optimal algorithm for computing a minimum nested nonconvex polygon ⋮ Unnamed Item ⋮ Diffuse reflection diameter and radius for convex-quadrilateralizable polygons ⋮ Minimum-link paths revisited ⋮ The complexity of drawing a graph in a polygonal region ⋮ Triangulating a simple polygon in linear time ⋮ Finding an approximate minimum-link visibility path inside a simple polygon ⋮ Decomposing the boundary of a nonconvex polyhedron ⋮ An \(O(n\log n)\) algorithm for computing the link center of a simple polygon ⋮ Minimum-link paths among obstacles in the plane ⋮ An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains ⋮ Decomposing the boundary of a nonconvex polyhedron ⋮ Diffuse reflection radius in a simple polygon ⋮ A fast shortest path algorithm on terrain-like graphs ⋮ Link Distance and Shortest Path Problems in the Plane ⋮ Rectilinear paths among rectilinear obstacles ⋮ Finding minimal nested polygons ⋮ Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons
This page was built for publication: A linear time algorithm for minimum link paths inside a simple polygon