A space-time trade-off for computing the visibility polygon in the multi-pass model
type: Item
instance of: scholarly article
title: A space-time trade-off for computing the visibility polygon in the multi-pass model
zbMATH Open document ID: 1436.68378
author: Mohammad Asgaripour
author: Ali Mohades
published in: Soft Computing
publication date: 2020-07-15T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 7220789
zbMATH Keywords: visibility polygon
zbMATH Keywords: limited memory
zbMATH Keywords: multi-pass model
MaRDI profile type: Publication
full work available at URL: s00500-019-04382-9
OpenAlex ID: W2987051945
cites work: Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon
cites work: Computing the Visibility Polygon Using Few Variables
cites work: Multi-pass geometric algorithms
DOI: 10.1007/S00500-019-04382-9
Recommended article: Space–Query-Time Tradeoff for Computing the Visibility Polygon
Recommended article: Space/query-time tradeoff for computing the visibility polygon
Recommended article: A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
Recommended article: Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon
Recommended article: A Framework for n-Dimensional Visibility Computations
Recommended article: AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
Recommended article: An optimal parallel algorithm for the visibility of a simple polygon from a point
Recommended article: Efficient visibility queries in simple polygons
Recommended article: Dynamic Algorithms for Visibility Polygons in Simple Polygons
description: scientific article; zbMATH DE number 7220789