An addendum to parallel methods for visibility and shortest-path problems in simple polygons
From MaRDI portal
Publication:2366233
DOI10.1007/BF01187038zbMath0795.68191MaRDI QIDQ2366233
Michael T. Goodrich, Steven B. Shauck, Sumantha Guha
Publication date: 29 June 1993
Published in: Algorithmica (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Related Items
Computing the L 1-diameter and center of a simple rectilinear polygon in parallel ⋮ Optimal parallel algorithms for rectilinear link-distance problems ⋮ Finding a closet visible vertex pair between two polygons
Cites Work
This page was built for publication: An addendum to parallel methods for visibility and shortest-path problems in simple polygons