A deterministic algorithm for fitting a step function to a weighted point-set

2011/09/06 by Hervé Fournier, Fournier, Hervé, Antoine Vigneron +1
Computer Science · #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #cs.CG #cs.DS

paper · pdf · doi:10.48550/arxiv.1109.1152

5 pages, 2 figures

arxiv created 2012/10/11 · arxiv updated 2012/10/12

Abstract

Given a set of n points in the plane, each point having a positive weight, and an integer k>0, we present an optimal O(n log n)-time deterministic algorithm to compute a step function with k steps that minimizes the maximum weighted vertical distance to the input points. It matches the expected time bound of the best known randomized algorithm for this problem. Our approach relies on Cole's improved parametric searching technique.

Related

• Linear-Time Fitting of a k-Step Function
• Assigning Weights to Minimize the Covering Radius in the Plane
• An Algorithm for L_∞ Approximation by Step Functions
• Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching
• A Polynomial Time Algorithm to Compute an Approximate Weighted Shortest Path