Topologically sweeping visibility complexes via pseudotriangulations
type: Item
instance of: scholarly article
title: Topologically sweeping visibility complexes via pseudotriangulations
zbMATH Open document ID: 0857.68063
DOI: 10.1007/BF02712876
published in: Discrete \& Computational Geometry
publication date: 1996-11-26T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 949874
zbMATH Keywords: visibility graphs
zbMATH Keywords: free bitangents
zbMATH Keywords: visibility complex
author: Michel Pocchiola
author: Gert Vegter
MaRDI profile type: Publication
cites work: Can visibility graphs be represented compactly?
cites work: Visibility of disjoint polygons
cites work: An optimal algorithm for intersecting line segments in the plane
cites work: DISTANCE VISIBILITY GRAPHS
cites work: Topologically sweeping an arrangement
cites work: A linear-time algorithm for a special case of disjoint set union
cites work: An Output-Sensitive Algorithm for Computing Visibility Graphs
cites work: An optimal visibility graph algorithm for triangulated simple polygons
cites work: Sorting jordan sequences in linear time using level-linked search trees
cites work: Q4057549
cites work: Q5485626
cites work: Greedoids
cites work: Q4309957
cites work: Q3219751
cites work: Q3998244
cites work: COMPUTATIONAL GEOMETRY COLUMN 18
cites work: Minimal tangent visibility graphs
cites work: Time and space efficient algorithms for shortest paths between convex polygons
cites work: Q3748279
cites work: A fast algorithm for computing sparse visibility graphs
cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
full work available at URL: https://doi.org/10.1007/bf02712876
OpenAlex ID: W2147097381
description: scientific article; zbMATH DE number 949874