Counting circles without computing them

DOI10.4230/LIPICS.FUN.2016.17MaRDI QIDQ5282815zbMATH OpenOpenAlexFDO

Authors Rudolf Fleischer

Publication date 17 July 2017

Full work available at URL https://dblp.uni-trier.de/db/conf/fun/fun2016.html#Fleischer16

zbMATH Keywords

trianglecircumcircleinscribed angle theoremlines arrangement

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On a triangle counting problem
• Counting Circular Arc Intersections
• On counting pairs of intersecting segments and off-line triangle range searching
• A simple aggregative algorithm for counting triangulations of planar point sets and related problems
• Counting and representing intersections among triangles in three dimensions

Cited in

(4)

• Counting Circular Arc Intersections
• scientific article; zbMATH DE number 4082565 (Why is no real title available?)
• Enumerating trichromatic triangles containing the origin in linear time
• On a triangle counting problem

This page was built for publication: Counting circles without computing them

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