Corrigendum: Topologically sweeping an arrangement
From MaRDI portal
Publication:2638777
DOI10.1016/0022-0000(91)90013-UzbMath0717.68039MaRDI 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
line arrangements; topological sweep; amortized complexity analysis; duality transform; sweepline paradigm
68Q25: Analysis of algorithms and problem complexity
Related Items
Unnamed Item, Gathering by Repulsion., Computing balanced convex partitions of lines, Stabbers of line segments in the plane, Topological sweep of the complete graph, Ham-sandwich cuts for abstract order types, Computational geometric approach to submodular function minimization for multiclass queueing systems, Lexicographicα-robustness: an application to the 1-median problem
Cites Work