Space-efficient algorithm for computing a centerpoint of a set of points in R2

We study a space-efficient algorithm for computing a centerpoint for a set P of n points in R2, where the points in P are given in a read-only array. We propose an algorithm that finds a centerpoint of P in O(T(n2)log3⁡n) time using O(S(n2)) extra space, where T(n) and S(n) are the time and extra sp...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 615; s. 61 - 70
Hlavní autori:	Bhattacharya, Binay K., Nandy, Subhas C., Roy, Sasanka
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.02.2016
Predmet:	Arrangement Centerpoint Duality Prune-and-search Space-efficient algorithm Space-efficient algorithm Duality Prune-and-search Centerpoint Arrangement
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!