# T Geometric Intersection Problems

@inproceedings{Hoey2008TGI, title={T Geometric Intersection Problems}, author={Dan Hoey}, year={2008} }

We develop optimal algorithms for forming the intersection of geometric objects in the plane and apply them to such diverse problems as linear programming, hidden-line elimination, and wire layout. Given N line segments in the plane, finding all intersecting pairs requires O(N2) time. We give an O(N log N) algorithm to determine i to detect whether two simple plane polygons intersect. We employ an whether any two intersect and use t O(N log N) algorithm for finding the common intersection of N…

## References

SHOWING 1-10 OF 16 REFERENCES

### On the Optimality of Some Set Algorithms

- MathematicsJACM
- 1972

The es tab l i shment of lower bounds on the number of comparisons necessary to solve various combinator problems is considered and the maximum of a set of n real numbers cannot be computed in fewer than n 1 comparisons if comparisons of only l inear funct ions of the numbers are permitted.

### The Design and Analysis of Computer Algorithms

- Computer Science
- 1974

This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.

### On the complexity of computations under varying sets of primitives

- Computer ScienceAutomata Theory and Formal Languages
- 1975

### Measuring Concavity on a Rectangular Mosaic

- BusinessIEEE Transactions on Computers
- 1972

A theory for describing and measuring the concavities of cellular complexes (digitized silhouettes) is developed. This theory involves the use of the minimum-perimeter polygon and its convex hull.

### I. Geometric Complexity. Proc. Seventh Annual ACM SIGACT Symposium

- I. Geometric Complexity. Proc. Seventh Annual ACM SIGACT Symposium
- 1975

### is required to count the number of intersecting pairs? 5. Of N line segments, suppose that k pairs intersect

- is required to count the number of intersecting pairs? 5. Of N line segments, suppose that k pairs intersect

### Is there an O(max{k, N log N» algorithm to list them? 4. Given N line segments in the plane, how much time 2

- Is there an O(max{k, N log N» algorithm to list them? 4. Given N line segments in the plane, how much time 2