Dynamic algorithms for approximating interdistances

DOI10.1007/3-540-45061-0_89MaRDI QIDQ4449249zbMATH OpenFDO

Authors Michael Segal, Sergei Bespamyatnikh

Publication date 8 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27191169.htm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 2149349
• Fast algorithms for approximating distances
• New Techniques for Exact and Approximate Dynamic Closest-Point Problems
• scientific article; zbMATH DE number 910882
• Fast, precise and dynamic distance queries

Cited in

(7)

• Fast algorithms for approximating distances
• Dynamic optimization of interval narrowing algorithms
• scientific article; zbMATH DE number 2149349 (Why is no real title available?)
• Fast, precise and dynamic distance queries
• An efficient algorithm for computing free distance (Corresp.)
• Computing and Combinatorics
• Dynamic data structures for approximate Hausdorff distance in the word RAM

This page was built for publication: Dynamic algorithms for approximating interdistances

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