A new approach to rectangle intersections-Reference-Cited by-同舟云学术

A new approach to rectangle intersections

Published:1983-01 Issue:3-4 Volume:13 Page:221-229
ISSN:0020-7160
Container-title:International Journal of Computer Mathematics
language:en
Short-container-title:International Journal of Computer Mathematics

Author:

Edelsbrunner Herbert

Publisher

Informa UK Limited

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Science Applications

Link

http://www.tandfonline.com/doi/pdf/10.1080/00207168308803365

Reference10 articles.

1. Decomposable searching problems

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

3. Edelsbrunner H. Dynamic rectangle intersection searching Report F47, Inst. for Inf. Proc. Techn. Univ. of Graz Austria 1980

4. Edelsbrunner H. A time- and space-optimal solution of the planar all intersecting rectangles problem Report F50, Inst. for Inf. Proc. Techn. Univ. of Graz Austria 1980

5. Edelsbrunner H. A time- and space-optimal solution of the planar all intersecting rectangles problem Report F59, Inst. for Inf. Proc. Techn. Univ. of Graz Austria 1980

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

1. Parallel Data Distribution Management on Shared-memory Multiprocessors;ACM Transactions on Modeling and Computer Simulation;2020-02-08

2. Interval stabbing on the Automata Processor;Journal of Parallel and Distributed Computing;2020-01

3. Semantics, Analysis and Simplification of DMN Decision Tables;Information Systems;2018-11

4. On Higher Dimensional Window Query;Proceedings of the International Conference on Informatics and Analytics;2016-08-25

5. Parallel Interval Stabbing on the Automata Processor;2016