scientific article
From MaRDI portal
Publication:3138983
zbMath0800.68974MaRDI QIDQ3138983
David Rappaport, Diane L. Souvaine, Jurek Czyzowicz, Peter Egyed, Jorge Urrutia, Godfried T. Toussaint, Hazel Everett, Thomas C. Shermer
Publication date: 20 October 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other problems of combinatorial convexity (52A37)
Related Items (9)
Computing minimum length paths of a given homotopy class ⋮ Computing a shortest watchman path in a simple polygon in polynomial-time ⋮ Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments ⋮ The touring rays and related problems ⋮ Polynomial-time algorithms for the touring rays and related problems ⋮ Finding shortest safari routes in simple polygons ⋮ Optimal placement of base stations in border surveillance using limited capacity drones ⋮ Watchman routes in the presence of a pair of convex polygons ⋮ Fast computation of shortest watchman routes in simple polygons
This page was built for publication:
