Space-Efficient Plane-Sweep Algorithms.
From MaRDI portal
Publication:4636513
DOI10.4230/LIPIcs.ISAAC.2016.30zbMath1398.68618arXiv1507.01767OpenAlexW2963304352MaRDI QIDQ4636513
Publication date: 19 April 2018
Full work available at URL: https://arxiv.org/abs/1507.01767
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Space-efficient biconnected components and recognition of outerplanar graphs ⋮ Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. ⋮ Simple 2^f-Color Choice Dictionaries ⋮ Space efficient linear time algorithms for BFS, DFS and applications
This page was built for publication: Space-Efficient Plane-Sweep Algorithms.