Counting Circular Arc Intersections

DOI10.1137/0222050MaRDI QIDQ3137708zbMATH OpenOpenAlexFDO

Authors Pankaj K. Agarwal, Marco Pellegrini, Micha Sharir

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Erd?s problems and related topics of discrete geometry (52C10)

Recommendations

• Intersection Queries in Curved Objects
• Counting circles without computing them
• Circle Shooting in a Simple Polygon
• Reporting and counting segment intersections
• Segment intersection searching problems in general settings

Cited in

(6)

• Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
• Counting circles without computing them
• Test for intersection between circle and rectangle
• Counting and representing intersections among triangles in three dimensions
• scientific article; zbMATH DE number 4082565 (Why is no real title available?)
• On intersection searching problems involving curved objects

This page was built for publication: Counting Circular Arc Intersections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137708)