Dynamic orthogonal segment intersection search

DOI10.1016/0196-6774(87)90024-1zbMath0642.68117OpenAlexW2020473451MaRDI QIDQ3783594

Takao Asano, Hiroshi Imai

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

zbMATH Keywords

data structuresdynamic searchgeometric searchingorthogonal segment intersection searchset-splitting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (15)

A linear algorithm for the maximal planar subgraph problem ⋮ An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs ⋮ Dynamic fractional cascading ⋮ Algorithmic aspects of proportional symbol maps ⋮ Efficient dynamic algorithms for some geometric intersection problems ⋮ Minimum-link paths revisited ⋮ Edge-orders ⋮ Output-sensitive generation of the perspective view of isothetic parallelepipeds ⋮ An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model ⋮ Output-sensitive generation of the perspective view of isothetic parallelepipeds ⋮ Fast incremental planarity testing ⋮ Light orthogonal networks with constant geometric dilation ⋮ Point Location in Incremental Planar Subdivisions. ⋮ Mondshein Sequences (a.k.a. (2,1)-Orders) ⋮ Rectilinear paths among rectilinear obstacles

This page was built for publication: Dynamic orthogonal segment intersection search