• Citer

Tight Bounds on the Number of Closest Pairs in Vertical Slabs

par Biniaz, Ahmad;Bose, Prosenjit ;Chung, Chaeyoon;De Carufel, Jean Lou;Iacono, John ;Maheshwari, Anil;Odak, Saeed;Smid, Michiel M.;Tóth, Csaba Dégi
Référence Leibniz international proceedings in informatics, 349, 8
Publication Publié, 2025-08-01

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

Let S be a set of n points in Rd, where d ≥ 2 is a constant, and let H1, H2, . . ., Hm+1 be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly n/m points of S are between any two successive hyperplanes. Let