Computing the visibility polygon from a convex set and related problems
From MaRDI portal
Publication:5750463
DOI10.1016/0196-6774(91)90024-SzbMath0718.68096OpenAlexW1964168400MaRDI QIDQ5750463
Publication date: 1991
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(91)90024-s
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (23)
Computing minimum length paths of a given homotopy class ⋮ An algorithm for recognizing palm polygons ⋮ Parallel algorithms for all minimum link paths and link center problems ⋮ Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons ⋮ Optimal parallel algorithms for rectilinear link-distance problems ⋮ Efficient piecewise-linear function approximation using the uniform metric ⋮ Optimal on-line algorithms for walking with minimum number of turns in unknown streets ⋮ Visibility with multiple diffuse reflections ⋮ Incremental Algorithms to Update Visibility Polygons ⋮ An optimal algorithm for computing a minimum nested nonconvex polygon ⋮ Diffuse reflection diameter and radius for convex-quadrilateralizable polygons ⋮ Multiple point visibility and related problems ⋮ Minimum-link paths revisited ⋮ Dynamic Algorithms for Visibility Polygons in Simple Polygons ⋮ Finding an approximate minimum-link visibility path inside a simple polygon ⋮ Computing the visibility polygon of an island in a polygonal domain ⋮ Characterizing and recognizing weak visibility polygons ⋮ An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains ⋮ Disproving a conjecture on planar visibility graphs ⋮ Algorithms for Computing Diffuse Reflection Paths in Polygons ⋮ A fast shortest path algorithm on terrain-like graphs ⋮ Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane ⋮ Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons
This page was built for publication: Computing the visibility polygon from a convex set and related problems
