Algorithms for Reporting and Counting Geometric Intersections

@article{Bentley1979AlgorithmsFR,
  title={Algorithms for Reporting and Counting Geometric Intersections},
  author={J. Bentley and T. Ottmann},
  journal={IEEE Transactions on Computers},
  year={1979},
  volume={C-28},
  pages={643-647}
}
An interesting class of "geometric intersection problems" calls for dealing with the pairwise intersections among a set of N objects in the plane, These problems arise in many applications such as printed circuit design, architectural data bases, and computer graphics. Shamos and Hoey have described a number of algorithms for detecting whether any two objects in a planar set intersect. In this paper we extend their work by giving algorithms that count the number of such intersections and… Expand
An efficient algorithm for planar subdivision intersection problems
TLDR
A generalization of Mairson's algorithm to solve the planar subdivision intersection problem is proposed and an implementation of the algorithm is presented and the empirical results are analyzed. Expand
Counting and representing intersections among triangles in three dimensions
TLDR
An algorithm that efficiently counts all intersecting triples among a collection T of triangles in R^3 in nearly quadratic time is presented and it is proved that this counting problem belongs to the 3sum-hard family, and thus the algorithm is likely to be nearly optimal in the worst case. Expand
Counting and representing intersections among triangles in three dimensions
TLDR
An algorithm that efficiently counts all intersecting triples among a collection T of triangles in ℝ3 in nearly-quadratic time is presented, and it is proved that this counting problem belongs to the 3SUM-hard family, and thus the algorithm is likely to be nearly optimal. Expand
An algorithm for counting line segments intersections using planar partitions
  • Masanori Ohdan, Y. Ueno, K. Aizawa
  • Mathematics, Computer Science
  • 2014 6th International Symposium on Communications, Control and Signal Processing (ISCCSP)
  • 2014
TLDR
The authors' algorithm divide given line segments into groups using Morton code and l quadtree levels and is effective as brute force algorithm when the number of intersections is large. Expand
New deterministic algorithms for counting pairs of intersecting segments and off-line triangle range searching
We describe a new method for decomposing planar sets of segments and points. Using this method we obtain new efficient deterministic algorithms for counting pairs of intersecting segments, and forExpand
Reporting and Counting Intersections of Lines within a Polygon
  • T. Asano
  • Mathematics, Computer Science
  • ISAAC
  • 1994
This paper presents efficient algorithms for reporting and counting intersections of line segments in the plane in an output-sensitive manner in several special cases. We also consider how to reportExpand
An optimal time and minimal space algorithm for rectangle intersection problems
  • D. Lee
  • Mathematics, Computer Science
  • International Journal of Computer & Information Sciences
  • 2004
TLDR
It is demonstrated that classical divide-and-conquer technique and conventional data structures such as linked lists are sufficient to achieve a time bound ofO(n logn) +s, and a space bound of Θ(n), both of which are optimal. Expand
An optimal algorithm for finding segments intersections
TLDR
A new deterministic algorithm for finding intersecting pairs from a given set of N segments in the plane that is asymptotically optimal and has time and space complexity O(AJ log N+ K) and 0( IV ) respectively. Expand
38 Geometric Intersection
Detecting whether two geometric objects intersect and computing the region of intersection are fundamental problems in computational geometry. Geometric intersection problems arise naturally in aExpand
Further Comparison of Algorithms for Geometric Intersection ProblemsD
The usual rst step in computing an overlay of two vector maps is to determine which pairs of segments (one from each map) intersect so as to perform line-breaking. We identify two classes ofExpand
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
Geometric intersection problems
  • M. Shamos, Dan Hoey
  • Computer Science, Mathematics
  • 17th Annual Symposium on Foundations of Computer Science (sfcs 1976)
  • 1976
TLDR
An O(N log N) algorithm is given to determine whether any two intersect and use it to detect whether two simple plane polygons intersect and to show that the Simplex method is not optimal. Expand
Fast algorithms for LSI artwork analysis
TLDR
A novel IC mask analysis algorithm is described which does not restrict the representation of artwork, permits a wide range of functions, avoids pathologies, and achieves good runtime and tolerable main memory demands, even for LSI applications. Expand
Eine neue Klass von ausgeglichenen Binarbaumen
  • Angewandte Informatik, vol. 9, pp. 395-400, 1976.
  • 1976
Four-dimensional binary search trees as a means to speed up associative searches in design rule verification of integrated circuits
  • J. Des. Autom. and Fault-Tolerant Comput., vol. 2, pp. 241-247, July 1978.
  • 1978
The Complexity of Finding Fixed-Radius Near Neighbors