Corrigendum: Topologically sweeping an arrangement

DOI10.1016/0022-0000(91)90013-UzbMath0717.68039OpenAlexW4211106575MaRDI QIDQ2638777

Leonidas J. Guibas, Herbert Edelsbrunner

Publication date: 1991

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(91)90013-u

zbMATH Keywords

line arrangementstopological sweepamortized complexity analysisduality transformsweepline paradigm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Computational geometric approach to submodular function minimization for multiclass queueing systems ⋮ Ham-sandwich cuts for abstract order types ⋮ Lexicographicα-robustness: an application to the 1-median problem ⋮ Stabbers of line segments in the plane ⋮ Computing balanced convex partitions of lines ⋮ Topological sweep of the complete graph ⋮ Unnamed Item ⋮ Gathering by Repulsion.

Cites Work

• The power of geometric duality
• Topologically sweeping an arrangement
• Constructing Arrangements of Lines and Hyperplanes with Applications