Plane-sweep algorithms for intersecting geometric figures-Reference-Cited by-同舟云学术

Plane-sweep algorithms for intersecting geometric figures

Published:1982-10 Issue:10 Volume:25 Page:739-747
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Nievergelt J.¹,Preparata F. P.²

Affiliation:

1. E. T. H, Zurich, Switzerland

2. Univ. of Illinois, Urbana

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Reference8 articles.

1. Algorithms for Reporting and Counting Geometric Intersections

2. An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles

3. E.M. McCreight. Efficient algorithms for enumerating intersecting intervals and rectangles. Report CSL 80-9 XEROX PARC June 1980. E.M. McCreight. Efficient algorithms for enumerating intersecting intervals and rectangles. Report CSL 80-9 XEROX PARC June 1980.

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

1. Extending Segment Tree for Polygon Clipping and Parallelizing using OpenMP and OpenACC Directives;Proceedings of the 53rd International Conference on Parallel Processing;2024-08-12

2. Elements of Timed Pattern Matching;ACM Transactions on Embedded Computing Systems;2024-06-10

3. RayJoin: Fast and Precise Spatial Join;Proceedings of the 38th ACM International Conference on Supercomputing;2024-05-30

4. Semi-supervised Deep Multi-view Stereo;Proceedings of the 31st ACM International Conference on Multimedia;2023-10-26

5. Efficient PRAM and Practical GPU Algorithms for Large Polygon Clipping with Degenerate Cases;2023 IEEE/ACM 23rd International Symposium on Cluster, Cloud and Internet Computing (CCGrid);2023-05