scientific article; zbMATH DE number 177543

MaRDI QIDQ4037412zbMATH OpenFDO

Authors Jeffrey S. Salowe

Publication date 18 May 1993

zbMATH Keywords

\(L_ \infty\) metric\(L_ p\) metricsalgorithm to enumerate \(k\) distances in \(d\)-spacefixed-radius near neighbors problemoptimal shallow interdistanceselection algorithm

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• ENUMERATING INTERDISTANCES IN SPACE
• SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
• L-infinity interdistance selection by parametric search
• ON ENUMERATING AND SELECTING DISTANCES
• scientific article; zbMATH DE number 2149349

Cited in

(4)

• L-infinity interdistance selection by parametric search
• Maintaining the minimal distance of a point set in polylogarithmic time
• Algorithms for proximity problems in higher dimensions
• A simple algorithm for enumerating longest distances in the plane

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 Q4037412)