Parallel batched planar point location on the CCC

DOI10.1016/0020-0190(89)90137-3zbMath0689.68063OpenAlexW2071153521MaRDI QIDQ582096

Jianyong Qiao, Sumit K. Garg

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90137-3

zbMATH Keywords

parallel computationcomputational geometryCREW PRAMpoint locationcube-connected-cycle (CCC) architecturefixed interconnections

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Discrete mathematics in relation to computer science (68R99)

Related Items (5)

Maximum weight independent set of circular-arc graph and its application ⋮ On the multisearching problem for hypercubes ⋮ A simplified technique for hidden-line elimination in terrains ⋮ Output-sensitive generation of the perspective view of isothetic parallelepipeds ⋮ AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS

Cites Work

• A New Approach to Planar Point Location

This page was built for publication: Parallel batched planar point location on the CCC