Counting Circular Arc Intersections
- 1 August 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (4) , 778-793
- https://doi.org/10.1137/0222050
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Selecting distances in the planeAlgorithmica, 1993
- Quasi-optimal upper bounds for simplex range searching and new zone theoremsAlgorithmica, 1992
- An optimal algorithm for intersecting line segments in the planeJournal of the ACM, 1992
- Partitioning arrangements of lines II: ApplicationsDiscrete & Computational Geometry, 1990
- Partitioning arrangements of lines I: An efficient deterministic algorithmDiscrete & Computational Geometry, 1990
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- An algorithm for generalized point location and its applicationsJournal of Symbolic Computation, 1990
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- Reporting and counting segment intersectionsJournal of Computer and System Sciences, 1986
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979