On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
From MaRDI portal
Publication:3978777
DOI10.1137/0220029zbMath0735.68089OpenAlexW2055488506WikidataQ60017381 ScholiaQ60017381MaRDI QIDQ3978777
Publication date: 25 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0220029
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph theory (05C99) Real and complex geometry (51M99)
Related Items (10)
Saturation of Multidimensional 0-1 Matrices ⋮ Planar rectilinear shortest path computation using corridors ⋮ Improved enumeration of simple topological graphs ⋮ Continuous-Time Moving Network Voronoi Diagram ⋮ Combinatorics of intervals in the plane. I: Trapezoids ⋮ Degrees of nonlinearity in forbidden 0-1 matrix problems ⋮ On the number of touching pairs in a set of planar curves ⋮ On the number of tangencies among 1-intersecting \(x\)-monotone curves ⋮ \(L_ 1\) shortest paths among polygonal obstacles in the plane ⋮ On counting pairs of intersecting segments and off-line triangle range searching
This page was built for publication: On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
