Parallel batched planar point location on the CCC (Q582096): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Sumit K. Garg / rank | |||
Normal rank | |||
Property / review text | |||
We consider the following problem, called ``batched planar point location'': Given a planar subdivision R induced by a plane graph \(G=(V,E)\), with \(| V| =N\), and a set S of M points in the plane, we wish to locate in parallel S in R, i.e., for each point \(p\in S\), we wish to find the region of R containing p. We assume throughout that \(M=\Theta (N)\). | |||
Property / review text: We consider the following problem, called ``batched planar point location'': Given a planar subdivision R induced by a plane graph \(G=(V,E)\), with \(| V| =N\), and a set S of M points in the plane, we wish to locate in parallel S in R, i.e., for each point \(p\in S\), we wish to find the region of R containing p. We assume throughout that \(M=\Theta (N)\). / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R99 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68U99 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4130015 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
point location | |||
Property / zbMATH Keywords: point location / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
computational geometry | |||
Property / zbMATH Keywords: computational geometry / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
parallel computation | |||
Property / zbMATH Keywords: parallel computation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
fixed interconnections | |||
Property / zbMATH Keywords: fixed interconnections / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
CREW PRAM | |||
Property / zbMATH Keywords: CREW PRAM / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
cube-connected-cycle (CCC) architecture | |||
Property / zbMATH Keywords: cube-connected-cycle (CCC) architecture / rank | |||
Normal rank |
Revision as of 19:03, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Parallel batched planar point location on the CCC |
scientific article |
Statements
Parallel batched planar point location on the CCC (English)
0 references
1989
0 references
We consider the following problem, called ``batched planar point location'': Given a planar subdivision R induced by a plane graph \(G=(V,E)\), with \(| V| =N\), and a set S of M points in the plane, we wish to locate in parallel S in R, i.e., for each point \(p\in S\), we wish to find the region of R containing p. We assume throughout that \(M=\Theta (N)\).
0 references
point location
0 references
computational geometry
0 references
parallel computation
0 references
fixed interconnections
0 references
CREW PRAM
0 references
cube-connected-cycle (CCC) architecture
0 references