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

Subhash Suri

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 classMinimal link visibility paths inside a simple polygonDiffuse reflection diameter in simple polygonsThe Complexity of Drawing a Graph in a Polygonal RegionConstructing pairwise disjoint paths with few linksUnnamed ItemParallel algorithms for all minimum link paths and link center problemsSingle-Point Visibility Constraint Minimum Link Paths in Simple PolygonsA linear-time algorithm for constructing a circular visibility diagramOptimal parallel algorithms for rectilinear link-distance problemsLinear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsSeparating two simple polygons by a sequence of translationsEfficient piecewise-linear function approximation using the uniform metricOptimal on-line algorithms for walking with minimum number of turns in unknown streetsAn O(n log n) algorithm for computing a link center in a simple polygonVisibility with multiple diffuse reflectionsColoring polygon visibility graphs and their generalizationsKinetic Geodesic Voronoi Diagrams in a Simple PolygonLink distance and shortest path problems in the planePartitioning arrangements of lines. I: An efficient deterministic algorithmConstruction of \(\epsilon\)-netsAn optimal algorithm for computing a minimum nested nonconvex polygonUnnamed ItemDiffuse reflection diameter and radius for convex-quadrilateralizable polygonsMinimum-link paths revisitedThe complexity of drawing a graph in a polygonal regionTriangulating a simple polygon in linear timeFinding an approximate minimum-link visibility path inside a simple polygonDecomposing the boundary of a nonconvex polyhedronAn \(O(n\log n)\) algorithm for computing the link center of a simple polygonMinimum-link paths among obstacles in the planeAn optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domainsDecomposing the boundary of a nonconvex polyhedronDiffuse reflection radius in a simple polygonA fast shortest path algorithm on terrain-like graphsLink Distance and Shortest Path Problems in the PlaneRectilinear paths among rectilinear obstaclesFinding minimal nested polygonsQuery-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