Sublinear Geometric Algorithms

DOI10.1137/S009753970444572XMaRDI QIDQ5470705zbMATH OpenFDO

Authors Ding Liu, Avner Magen, Bernard Chazelle

Publication date 1 June 2006

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S009753970444572X

zbMATH Keywords

approximate shortest pathspolyhedral intersectionsublinear algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• Sublinear geometric algorithms
• Applications of random sampling in computational geometry. II
• Multi-pass geometric algorithms
• Multi-pass geometric algorithms
• Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time

Cited in

(19)

• Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
• Suboptimal solutions to the algebraic-error line triangulation
• Practical distribution-sensitive point location in triangulations
• Sublinear randomized algorithms for skeleton decompositions
• Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
• Sublinear geometric algorithms
• Linear-time algorithms for geometric graphs with sublinearly many crossings
• A Subexponential Algorithm for Abstract Optimization Problems
• Sublinear-time Algorithms
• Testing Euclidean Spanners
• Approximating the maximum overlap of polygons under translation
• Multi-pass geometric algorithms
• Linear-time algorithms for geometric graphs with sublinearly many edge crossings
• Separating Sublinear Time Computations by Approximate Diameter
• Algorithms for approximate shortest path queries on weighted polyhedral surfaces
• Sublinear time approximation schemes for makespan minimization on parallel machines
• Sublinear algorithms for scheduling with chain precedence constraints
• Separating sublinear time computations by approximate diameter
• A sublogarithmic convex hull algorithm

This page was built for publication: Sublinear Geometric Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470705)