A space-time trade-off for computing the visibility polygon in the multi-pass model

DOI10.1007/S00500-019-04382-9zbMath1436.68378OpenAlexW2987051945MaRDI QIDQ780246

Mohammad Asgaripour, Ali Mohades

Publication date: 15 July 2020

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-019-04382-9

zbMATH Keywords

limited memoryvisibility polygonmulti-pass model

Mathematics Subject Classification ID

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

Cites Work

• Multi-pass geometric algorithms
• Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon
• Computing the Visibility Polygon Using Few Variables

This page was built for publication: A space-time trade-off for computing the visibility polygon in the multi-pass model