Counting Circular Arc Intersections

DOI10.1137/0222050zbMATH Open0789.68137OpenAlexW2068760203MaRDI QIDQ3137708FDOQ3137708

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

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

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)

Cited In (6)

• On intersection searching problems involving curved objects
• Title not available (Why is that?)
• Test for intersection between circle and rectangle
• Counting circles without computing them
• 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

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