Minimal tangent visibility graphs (Q1924714): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Michel Pocchiola / rank
Normal rank
 
Property / author
 
Property / author: Gert Vegter / rank
Normal rank
 
Property / author
 
Property / author: Michel Pocchiola / rank
 
Normal rank
Property / author
 
Property / author: Gert Vegter / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility of disjoint polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topologically sweeping an arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Output-Sensitive Algorithm for Computing Visibility Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotation and Winding Numbers for Planar Polygons and Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Maps on Orientable Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTATIONAL GEOMETRY COLUMN 18 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topologically sweeping visibility complexes via pseudotriangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in the plane with convex polygonal obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and space efficient algorithms for shortest paths between convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight lower bound on the size of visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on minimal visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing sparse visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time / rank
 
Normal rank

Latest revision as of 14:21, 24 May 2024

scientific article
Language Label Description Also known as
English
Minimal tangent visibility graphs
scientific article

    Statements

    Identifiers