Two Algorithms for the Sum of Diameters Problem and a Related Problem

DOI10.1142/S0218195997000302MaRDI QIDQ4365030zbMATH OpenFDO

Authors M. H. Alsuwaiyel

Publication date 30 October 1997

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

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

zbMATH Keywords

dense point setdiametral pairfarthest-point Voronoi diagram

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Minimizing the sum of diameters efficiently
• scientific article; zbMATH DE number 867650
• A parallel algorithm for partitioning a point set to minimize the maximum of diameters

Cited in

(5)

• Minimizing the sum of diameters efficiently
• An algorithm to find the number of the digitizations of discs with a fixed radius
• On the union complexity of diametral disks
• An efficient algorithm for the three-dimensional diameter problem
• A parallel algorithm for partitioning a point set to minimize the maximum of diameters

This page was built for publication: Two Algorithms for the Sum of Diameters Problem and a Related Problem

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