Computing a centerpoint of a finite planar set of points in linear time
type: Item
instance of: scholarly article
title: Computing a centerpoint of a finite planar set of points in linear time
zbMATH Open document ID: 0819.68137
DOI: 10.1007/BF02574382
author: V. Pereyra
published in: Discrete \& Computational Geometry
publication date: 1994-11-27T00:00:00Z
full work available at URL: https://eudml.org/doc/131333
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 51M15
zbMATH DE Number: 695538
zbMATH Keywords: linear-time algorithm
zbMATH Keywords: centerpoint
MaRDI profile type: Publication
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: On k-Hulls and Related Problems
cites work: Q3772828
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Partitioning with two lines in the plane
cites work: Q3278735
OpenAlex ID: W2134711657
description: scientific article; zbMATH DE number 695538