Sublinear Geometric Algorithms
From MaRDI portal
Publication:5470705
DOI10.1137/S009753970444572XzbMath1095.68124MaRDI QIDQ5470705
Avner Magen, Ding Liu, Bernard Chazelle
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68W05: Nonnumerical algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Testing Euclidean Spanners, Sublinear-time Algorithms, Separating Sublinear Time Computations by Approximate Diameter, Algorithms for approximate shortest path queries on weighted polyhedral surfaces, Separating sublinear time computations by approximate diameter, Practical distribution-sensitive point location in triangulations