Batch Intersection Algorithms

Batch Intersection Algorithms is a computational method that identifies all pairwise intersections among a set of line segments in a single processing step, distinguished from incremental or output-sensitive approaches by its aggregate treatment of input segments.

Publications

110

Citations

Authors

Institutions

Publications per year

2017–2026

Parents

Line Segment Intersection

Publications

Colored intersection searching via sparse rectangular matrix multiplication

Haim Kaplan, Micha Sharir, Elad Verbin · 2006 · 45 citations

Computing, Computer Science, Algorithms +11

Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems

Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy et al. · 1998 · 32 citations · Full text

Computing, Computer Engineering, Computer Science +16

A Batched GPU Algorithm for Set Intersection

Di Wu, Fan Zhang, Naiyong Ao et al. · 2009 · 19 citations

Computing, Computer Science, High-performance Computing +17

Multi-Sensor Fusion Positioning Method Based on Batch Inverse Covariance Intersection and IMM

Yanxu Liu, Zhongliang Deng, Enwen Hu · Applied Sciences · 2021 · 14 citations · Full text

Engineering, Mechatronics Engineering, Fusion Engineering +16

Distributed estimation in general directed sensor networks based on batch covariance intersection

Tao Sun, Ming Xin, Bin Jia · 2016 · 12 citations

Computing, Computer Science, Distributed Systems +16

1–5 of 4

Authors

LA
Lars Arge
Aarhus University, Denmark
1 publications · 32 citations
1
h-index
OP
Octavian Procopiuc
Duke University, United States
1 publications · 32 citations
1
h-index
EH
Enwen Hu
Beijing University of Posts and Telecommunications, China
1 publications · 14 citations
1
h-index
XL
Xiaoguang Liu
Nankai University, China
1 publications · 19 citations
1
h-index
GW
Gang Wang
Baidu (China), China
1 publications · 19 citations
1
h-index

1–5 of 17

Institutions

1–7 of 5

Venues

Applied Sciences
1 publications · 14 citations
1
h-index

1–1