Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon

DOI10.1006/jagm.1996.0023zbMath0845.68108OpenAlexW1989541681MaRDI QIDQ4881404

Danny Z. Chen

Publication date: 9 June 1996

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1949&context=cstech

zbMATH Keywords

CREW PRAM computational model

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Optimally computing a shortest weakly visible line segment inside a simple polygon ⋮ Open Guard Edges and Edge Guards in Simple Polygons ⋮ LR-visibility in polygons ⋮ Finding the shortest boundary guard of a simple polygon ⋮ Guarding in a simple polygon ⋮ Determining Weak Visibility of a Polygon from an Edge in Parallel

This page was built for publication: Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon