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

DOI10.1007/S00500-019-04382-9MaRDI QIDQ780246zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Space–Query-Time Tradeoff for Computing the Visibility Polygon
• Space/query-time tradeoff for computing the visibility polygon
• A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
• Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon
• A framework for \(n\)-dimensional visibility computations
• AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
• An optimal parallel algorithm for the visibility of a simple polygon from a point
• Efficient visibility queries in simple polygons
• Dynamic algorithms for visibility polygons in simple polygons

Cites work

• Computing the visibility polygon using few variables
• Multi-pass geometric algorithms
• Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon

Cited in

(4)

• Computing the visibility polygon using few variables
• Space–Query-Time Tradeoff for Computing the Visibility Polygon
• Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon
• Space/query-time tradeoff for computing the visibility polygon

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780246)