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)
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Practical distribution-sensitive point location in triangulations ⋮ Separating sublinear time computations by approximate diameter ⋮ Algorithms for approximate shortest path queries on weighted polyhedral surfaces ⋮ Testing Euclidean Spanners ⋮ Approximating the maximum overlap of polygons under translation ⋮ Sublinear-time Algorithms ⋮ Recognizing the tractability in big data computing ⋮ Separating Sublinear Time Computations by Approximate Diameter