Visibility queries and maintenance in simple polygons
type: Item
instance of: scholarly article
title: Visibility queries and maintenance in simple polygons
zbMATH Open document ID: 1008.68144
author: R. Smith
published in: Discrete \& Computational Geometry
publication date: 2002-08-20T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1784783
zbMATH Keywords: visibility polygons
zbMATH Keywords: shortest-path trees
MaRDI profile type: Publication
full work available at URL: s00454-001-0089-9
OpenAlex ID: W1494368934
DOI: 10.1007/S00454-001-0089-9
Recommended article: Efficient visibility queries in simple polygons
Recommended article: Visibility queries in a polygonal region
Recommended article: Quickest visibility queries in polygonal domains
Recommended article: Q4580139
Recommended article: Maintaining the visibility graph of a dynamic simple polygon
Recommended article: Dynamic Algorithms for Visibility Polygons in Simple Polygons
Recommended article: Visibility polygon queries among dynamic polygonal obstacles in plane
Recommended article: Weak visibility queries of line segments in simple polygons
Recommended article: Space/query-time tradeoff for computing the visibility polygon
description: scientific article; zbMATH DE number 1784783