License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FUN.2016.17
URN: urn:nbn:de:0030-drops-58767
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/5876/
Go to the corresponding LIPIcs Volume Portal

Fleischer, Rudolf

Counting Circles Without Computing Them

pdf-format:
16.pdf (0.4 MB)

Abstract

In this paper we engineer a fast algorithm to count the number of triangles defined by three lines out of a set of n lines whose circumcircle contains the origin. The trick is not to compute any triangles or circles.

BibTeX - Entry

@InProceedings{fleischer:LIPIcs:2016:5876,
  author =	{Rudolf Fleischer},
  title =	{{Counting Circles Without Computing Them}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{17:1--17:7},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Erik D. Demaine and Fabrizio Grandoni},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/5876},
  URN =		{urn:nbn:de:0030-drops-58767},
  doi =		{10.4230/LIPIcs.FUN.2016.17},
  annote =	{Keywords: lines arrangement, triangle, circumcircle, inscribed angle theorem}
}

Keywords: lines arrangement, triangle, circumcircle, inscribed angle theorem
Collection: 8th International Conference on Fun with Algorithms (FUN 2016)
Issue Date: 2016
Date of publication: 02.06.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI