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

Handle URI:
http://hdl.handle.net/10754/562621
Title:
A deterministic algorithm for fitting a step function to a weighted point-set
Authors:
Fournier, Hervé; Vigneron, Antoine E. ( 0000-0003-3586-3431 )
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(nlogn)-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 Coles improved parametric searching technique. As a direct application, our result yields the first O(nlogn)-time algorithm for computing a k-center of a set of n weighted points on the real line. © 2012 Elsevier B.V.
KAUST Department:
Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Computer Science Program; Geometric Algorithms Group
Publisher:
Elsevier
Journal:
Information Processing Letters
Issue Date:
Feb-2013
DOI:
10.1016/j.ipl.2012.11.003
ARXIV:
arXiv:1109.1152
Type:
Article
ISSN:
00200190
Additional Links:
http://arxiv.org/abs/arXiv:1109.1152v2
Appears in Collections:
Articles; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorFournier, Hervéen
dc.contributor.authorVigneron, Antoine E.en
dc.date.accessioned2015-08-03T10:58:42Zen
dc.date.available2015-08-03T10:58:42Zen
dc.date.issued2013-02en
dc.identifier.issn00200190en
dc.identifier.doi10.1016/j.ipl.2012.11.003en
dc.identifier.urihttp://hdl.handle.net/10754/562621en
dc.description.abstractGiven a set of n points in the plane, each point having a positive weight, and an integer k>0, we present an optimal O(nlogn)-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 Coles improved parametric searching technique. As a direct application, our result yields the first O(nlogn)-time algorithm for computing a k-center of a set of n weighted points on the real line. © 2012 Elsevier B.V.en
dc.publisherElsevieren
dc.relation.urlhttp://arxiv.org/abs/arXiv:1109.1152v2en
dc.subjectAlgorithm designen
dc.subjectComputational geometryen
dc.subjectk-Centeren
dc.subjectOptimizationen
dc.subjectShape fittingen
dc.titleA deterministic algorithm for fitting a step function to a weighted point-seten
dc.typeArticleen
dc.contributor.departmentVisual Computing Center (VCC)en
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentComputer Science Programen
dc.contributor.departmentGeometric Algorithms Groupen
dc.identifier.journalInformation Processing Lettersen
dc.contributor.institutionUniv Paris Diderot, Sorbonne Paris Cité, UMR 7586 CNRS, F-75205 Paris, Franceen
dc.identifier.arxividarXiv:1109.1152en
kaust.authorVigneron, Antoine E.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.