Dynamic orthogonal segment intersection search
From MaRDI portal
Publication:3783594
DOI10.1016/0196-6774(87)90024-1zbMath0642.68117MaRDI QIDQ3783594
Publication date: 1987
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(87)90024-1
data structures; dynamic search; geometric searching; orthogonal segment intersection search; set-splitting
Related Items
Fast incremental planarity testing, An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model, Dynamic fractional cascading, Efficient dynamic algorithms for some geometric intersection problems, Light orthogonal networks with constant geometric dilation, Output-sensitive generation of the perspective view of isothetic parallelepipeds, Edge-orders, Algorithmic aspects of proportional symbol maps, An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs, Minimum-link paths revisited, Rectilinear paths among rectilinear obstacles, Mondshein Sequences (a.k.a. (2,1)-Orders)