An optimal expected-time parallel algorithm for Voronoi diagrams
Publikation: Working paper › Forskning
Standard
An optimal expected-time parallel algorithm for Voronoi diagrams. / Katajainen, Jyrki; Levcopoulos, Christos; Lingas, Andrzej.
Department of Computer and Information Science, Linko¨bing University, 1989.Publikation: Working paper › Forskning
Harvard
Katajainen, J, Levcopoulos, C & Lingas, A 1989 'An optimal expected-time parallel algorithm for Voronoi diagrams' Department of Computer and Information Science, Linko¨bing University.
APA
Katajainen, J., Levcopoulos, C., & Lingas, A. (1989). An optimal expected-time parallel algorithm for Voronoi diagrams. Department of Computer and Information Science, Linko¨bing University.
Vancouver
Katajainen J, Levcopoulos C, Lingas A. An optimal expected-time parallel algorithm for Voronoi diagrams. Department of Computer and Information Science, Linko¨bing University. 1989.
Author
Bibtex
@techreport{1471a460f55911de825d000ea68e967b,
title = "An optimal expected-time parallel algorithm for Voronoi diagrams",
author = "Jyrki Katajainen and Christos Levcopoulos and Andrzej Lingas",
year = "1989",
language = "English",
publisher = "Department of Computer and Information Science, Linko¨bing University",
type = "WorkingPaper",
institution = "Department of Computer and Information Science, Linko¨bing University",
}
RIS
TY - UNPB
T1 - An optimal expected-time parallel algorithm for Voronoi diagrams
AU - Katajainen, Jyrki
AU - Levcopoulos, Christos
AU - Lingas, Andrzej
PY - 1989
Y1 - 1989
M3 - Working paper
BT - An optimal expected-time parallel algorithm for Voronoi diagrams
PB - Department of Computer and Information Science, Linko¨bing University
ER -
ID: 16638070