A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency

DOI10.1007/BF01553879zbMath0664.68064OpenAlexW2042382368MaRDI QIDQ1115624

Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano

Publication date: 1989

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01553879

zbMATH Keywords

VLSI designcomputational geometrypriority search treebucketingfiltering searchlayered segment treesegment intersection search

Mathematics Subject Classification ID

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

Related Items

Orthogonal queries in segments

Cites Work

• Unnamed Item
• Priority Search Trees
• Optimal Point Location in a Monotone Subdivision
• Filtering Search: A New Approach to Query-Answering
• Rectilinear line segment intersection, layered segment trees, and dynamization