An optimal parallel algorithm for building a data structure for planar point location

Richard Cole, Ofer Zajlcek

Research output: Contribution to journalArticle

Abstract

Using a modification of the Approximate Parallel Scheduling of R. Cole and U. Vishkin (SIAM J. Comput. 17, 11988),128-142), we give an optimal parallel algorithm for generating a linear size data structure for planar point location that supports an O(log n) query time. Our algorithm runs on a CREW PRAM in time O(log n) using n log n processors.

Original languageEnglish (US)
Pages (from-to)280-285
Number of pages6
JournalJournal of Parallel and Distributed Computing
Volume8
Issue number3
DOIs
StatePublished - 1990

Fingerprint

Point Location
Optimal Algorithm
Parallel algorithms
Parallel Algorithms
Data structures
Data Structures
Scheduling
Query

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

An optimal parallel algorithm for building a data structure for planar point location. / Cole, Richard; Zajlcek, Ofer.

In: Journal of Parallel and Distributed Computing, Vol. 8, No. 3, 1990, p. 280-285.

Research output: Contribution to journalArticle

@article{0075a80a62c4431b9a5434262765665a,
title = "An optimal parallel algorithm for building a data structure for planar point location",
abstract = "Using a modification of the Approximate Parallel Scheduling of R. Cole and U. Vishkin (SIAM J. Comput. 17, 11988),128-142), we give an optimal parallel algorithm for generating a linear size data structure for planar point location that supports an O(log n) query time. Our algorithm runs on a CREW PRAM in time O(log n) using n log n processors.",
author = "Richard Cole and Ofer Zajlcek",
year = "1990",
doi = "10.1016/0743-7315(90)90103-V",
language = "English (US)",
volume = "8",
pages = "280--285",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - An optimal parallel algorithm for building a data structure for planar point location

AU - Cole, Richard

AU - Zajlcek, Ofer

PY - 1990

Y1 - 1990

N2 - Using a modification of the Approximate Parallel Scheduling of R. Cole and U. Vishkin (SIAM J. Comput. 17, 11988),128-142), we give an optimal parallel algorithm for generating a linear size data structure for planar point location that supports an O(log n) query time. Our algorithm runs on a CREW PRAM in time O(log n) using n log n processors.

AB - Using a modification of the Approximate Parallel Scheduling of R. Cole and U. Vishkin (SIAM J. Comput. 17, 11988),128-142), we give an optimal parallel algorithm for generating a linear size data structure for planar point location that supports an O(log n) query time. Our algorithm runs on a CREW PRAM in time O(log n) using n log n processors.

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

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

U2 - 10.1016/0743-7315(90)90103-V

DO - 10.1016/0743-7315(90)90103-V

M3 - Article

VL - 8

SP - 280

EP - 285

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 3

ER -