scientific article; zbMATH DE number 2038782

zbMATH Open1039.68768MaRDI QIDQ4449249FDOQ4449249

Authors: Michael Segal, Sergei Bespamyatnikh 

Publication date: 8 February 2004

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

Title of this publication is not available (Why is that?)

Recommendations

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

Mathematics Subject Classification ID

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

Cited In (7)

• Dynamic optimization of interval narrowing algorithms
• An efficient algorithm for computing free distance (Corresp.)
• Title not available (Why is that?)
• Fast, precise and dynamic distance queries
• Fast algorithms for approximating distances
• Computing and Combinatorics
• Dynamic data structures for approximate Hausdorff distance in the word RAM

This page was built for publication:

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