Computing the full visibility graph of a set of line segments
type: Item
instance of: scholarly article
title: Computing the full visibility graph of a set of line segments
zbMATH Open document ID: 0772.68109
DOI: 10.1016/0020-0190(92)90033-R
published in: Information Processing Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 92126
zbMATH Keywords: visibility graph
author: S. Wismath
MaRDI profile type: Publication
cites work: Visibility of disjoint polygons
cites work: An Output-Sensitive Algorithm for Computing Visibility Graphs
cites work: Q3799261
cites work: A unified approach to visibility representations of planar graphs
cites work: Shortest path solves edge-to-edge visibility in a polygon
cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
full work available at URL: 0020-0190(92)90033-r
OpenAlex ID: W2090581029
Recommended article: Computing the visibility graph of points within a polygon
Recommended article: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
Recommended article: Q3619953
Recommended article: Visibility graphs of point sets in the plane
Recommended article: Computing the visibility polygon from a convex set and related problems
Recommended article: Planar segment visibility graphs
Recommended article: Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
Recommended article: A new algorithm for computing visibility graphs of polygonal obstacles in the plane
Recommended article: Unsolved problems in visibility graphs of points, segments, and polygons
description: scientific article; zbMATH DE number 92126