A Nearly Optimal Deterministic Parallel Voronoi Diagram Algorithm

R. Cole, M. T. Goodrich, C. Ó Dúnlaing

Research output: Contribution to journalArticle

Abstract

We describe an n-processor, O (log(n) log log(n))-time CRCW algorithm to construct the Voronoi diagram for a set of n point-sites in the plane.

Original languageEnglish (US)
Pages (from-to)569-617
Number of pages49
JournalAlgorithmica (New York)
Volume16
Issue number6
StatePublished - Dec 1996

Fingerprint

Voronoi Diagram

Keywords

  • Parallel algorithm
  • Voronoi diagram

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Safety, Risk, Reliability and Quality
  • Applied Mathematics

Cite this

Cole, R., Goodrich, M. T., & Dúnlaing, C. Ó. (1996). A Nearly Optimal Deterministic Parallel Voronoi Diagram Algorithm. Algorithmica (New York), 16(6), 569-617.

A Nearly Optimal Deterministic Parallel Voronoi Diagram Algorithm. / Cole, R.; Goodrich, M. T.; Dúnlaing, C. Ó.

In: Algorithmica (New York), Vol. 16, No. 6, 12.1996, p. 569-617.

Research output: Contribution to journalArticle

Cole, R, Goodrich, MT & Dúnlaing, CÓ 1996, 'A Nearly Optimal Deterministic Parallel Voronoi Diagram Algorithm', Algorithmica (New York), vol. 16, no. 6, pp. 569-617.
Cole, R. ; Goodrich, M. T. ; Dúnlaing, C. Ó. / A Nearly Optimal Deterministic Parallel Voronoi Diagram Algorithm. In: Algorithmica (New York). 1996 ; Vol. 16, No. 6. pp. 569-617.
@article{8fa81de75b314d38bce2ef3bef9bc308,
title = "A Nearly Optimal Deterministic Parallel Voronoi Diagram Algorithm",
abstract = "We describe an n-processor, O (log(n) log log(n))-time CRCW algorithm to construct the Voronoi diagram for a set of n point-sites in the plane.",
keywords = "Parallel algorithm, Voronoi diagram",
author = "R. Cole and Goodrich, {M. T.} and D{\'u}nlaing, {C. {\'O}}",
year = "1996",
month = "12",
language = "English (US)",
volume = "16",
pages = "569--617",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "6",

}

TY - JOUR

T1 - A Nearly Optimal Deterministic Parallel Voronoi Diagram Algorithm

AU - Cole, R.

AU - Goodrich, M. T.

AU - Dúnlaing, C. Ó

PY - 1996/12

Y1 - 1996/12

N2 - We describe an n-processor, O (log(n) log log(n))-time CRCW algorithm to construct the Voronoi diagram for a set of n point-sites in the plane.

AB - We describe an n-processor, O (log(n) log log(n))-time CRCW algorithm to construct the Voronoi diagram for a set of n point-sites in the plane.

KW - Parallel algorithm

KW - Voronoi diagram

UR - http://www.scopus.com/inward/record.url?scp=0141878573&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0141878573&partnerID=8YFLogxK

M3 - Article

VL - 16

SP - 569

EP - 617

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 6

ER -