Counting Circular Arc Intersections
From MaRDI portal
Publication:3137708
DOI10.1137/0222050zbMath0789.68137OpenAlexW2068760203MaRDI QIDQ3137708
Marco Pellegrini, Micha Sharir, Pankaj K. Agarwal
Publication date: 10 October 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0222050
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Erd?s problems and related topics of discrete geometry (52C10) Data structures (68P05)
Related Items (3)
On intersection searching problems involving curved objects ⋮ Counting and representing intersections among triangles in three dimensions ⋮ Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
This page was built for publication: Counting Circular Arc Intersections
