2018/09/05 by Mahmoodreza Jahanseir, Jahanseir, Mahmoodreza, Donald R. Sheehy +1
Computer Science · #Advanced Database Systems and Queries #Algorithms and Data Compression #Computational Geometry (cs.CG) #Data Management and Algorithms #FOS: Computer and information sciences #cs.CG
paper · pdf · doi:10.48550/arxiv.1809.01308
arxiv created 2018/09/05 · openalex publication_date 2018/09/05 · arxiv updated 2018/09/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Net-trees are a general purpose data structure for metric data that have been used to solve a wide range of algorithmic problems. We give a simple randomized algorithm to construct net-trees on doubling metrics using O(nlog n) time in expectation. Along the way, we define a new, linear-size net-tree variant that simplifies the analyses and algorithms. We show a connection between these trees and approximate Voronoi diagrams and use this to simplify the point location necessary in net-tree construction. Our analysis uses a novel backwards analysis that may be of independent interest.