ENUMERATING INTERDISTANCES IN SPACE

DOI10.1142/S0218195992000044zbMath0764.68179OpenAlexW2129335013MaRDI QIDQ4016892

Jeffrey S. Salowe

Publication date: 16 January 1993

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195992000044

zbMATH Keywords

fixed-radius near neighbors problemselection problemsinterdistance enumeration problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Exact enumeration problems, generating functions (05A15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

An optimal algorithm for the on-line closest-pair problem ⋮ Efficient construction of a bounded-degree spanner with low weight ⋮ Algorithms for proximity problems in higher dimensions ⋮ Geometric Applications of Posets ⋮ Fast greedy triangulation algorithms. ⋮ ON ENUMERATING AND SELECTING DISTANCES ⋮ Deformable spanners and applications ⋮ Region-fault tolerant geometric spanners ⋮ Geometric applications of posets

This page was built for publication: ENUMERATING INTERDISTANCES IN SPACE