ENUMERATING INTERDISTANCES IN SPACE

DOI10.1142/S0218195992000044MaRDI QIDQ4016892zbMATH OpenOpenAlexFDO

Authors 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 probleminterdistance enumeration problemsselection problems

Mathematics Subject Classification ID

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

Recommendations

• ON ENUMERATING AND SELECTING DISTANCES
• Repeated distances in space
• Determining the interset distance
• Counting Spaces
• Counting distance permutations
• Distinct distances determined by subsets of a point set in space
• Counting ultrametric spaces
• Distinct distances and arithmetic progressions

Cited in

(13)

• Region-fault tolerant geometric spanners
• Fixed-radius near neighbors search
• The complexity of finding fixed-radius near neighbors
• Geometric applications of posets
• An optimal algorithm for the on-line closest-pair problem
• Algorithms for proximity problems in higher dimensions
• Efficient construction of a bounded-degree spanner with low weight
• Fast greedy triangulation algorithms.
• Deformable spanners and applications
• scientific article; zbMATH DE number 177543 (Why is no real title available?)
• ON ENUMERATING AND SELECTING DISTANCES
• Geometric applications of posets
• Fixed-radius near neighbors search algorithms for points and segments

This page was built for publication: ENUMERATING INTERDISTANCES IN SPACE

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