Finding connected components of an intersection graph of squares in the Euclidean plane

DOI10.1016/0020-0190(82)90044-8zbMath0494.68055OpenAlexW2020231257MaRDI QIDQ1169296

Hiroshi Imai

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90044-8

zbMATH Keywords

algorithmdata structurescomputational geometryintersection graph of given objects in the planesweep scheme

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99)

Cites Work

• On the complexity of computations under varying sets of primitives
• Efficiency of a Good But Not Linear Set Union Algorithm
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding connected components of an intersection graph of squares in the Euclidean plane