Parallel batched planar point location on the CCC-Reference-Cited by-同舟云学术

Parallel batched planar point location on the CCC

Published:1989-12 Issue:4 Volume:33 Page:175-179
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Lee D.T.,Preparata F.P.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference5 articles.

1. Cascading divide-and-conquer: A technique for designing parallel algorithms;Atallah;Proc. 28th IEEE Symposium on Foundations of Computer Science,1987

2. Data broadcasting in SIMD computers;Nassimi;IEEE Trans. Comput.,1981

3. Range searching in a set of line segments;Overmars;Proc. ACM Symp. on Computational Geometry,1985

4. A new approach to planar point location;Preparata;SIAM J. Comput.,1981

5. The cube-connected-cycles: A versatile network for parallel computation;Preparata;Comm. ACM,1981

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maximum weight independent set of circular-arc graph and its application;Journal of Applied Mathematics and Computing;2006-10

2. AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS;International Journal of Computational Geometry & Applications;1999-02

3. On the multisearching problem for hypercubes;Computational Geometry;1996-03

4. A SIMPLIFIED TECHNIQUE FOR HIDDEN-LINE ELIMINATION IN TERRAINS;International Journal of Computational Geometry & Applications;1993-06

5. Output-sensitive generation of the perspective view of isothetic parallelepipeds;Algorithmica;1992-12