Lenses in arrangements of pseudo-circles and their applications

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2002, Pages 123-132

  Agarwal, Pankaj ^a   Nevo, Eran ^b   Pach, János ^b   Pinchasi, Rom ^c,d   Smorodinsky, Shakhar ^e  

^a DUKE UNIVERSITY   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c NEW YORK UNIVERSITY   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e TEL AVIV UNIVERSITY   (Israel)

Author keywords

Arrangements; Distinct distances; Incidences; Lenses; Levels; Pseudo circles

Indexed keywords

ALGORITHMS; FUNCTIONS; LENSES; THEOREM PROVING;

INVERSE ACKERMANN FUNCTIONS;

COMPUTATIONAL GEOMETRY;

EID: 0036367546     PISSN: None     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. On the complexity of many faces in arrangements of pseudo-segments and of circles
2. Arrangements and their applications
3. Transversal numbers for hypergraphs arising in geometry
4. Piercing convex sets and the Hadwiger-Debrunner (p, q)-problem
5. On the complexity of arrangements of circles in the plane
6. Cutting circles into pseudo-segments and improved bounds for incidences
7. On levels in arrangements of curves
8. A deterministic view of random sampling and its use in geometry
9. Über wesentlich unplättbare Kurven im dreidimensionalen Raume
10. Über Systeme abgeschlossener Mengen mit gemeinschaftlichen Punkten
11. Sweeping arrangements of curves
12. On Conway's thrackle conjecture
13. Über eine Verallgemeinerung auf die Kugelfläche eines topologischen Satzes von Helly
14. How to cut pseudo-parabolas into segments
15. Toward a theory of crossing numbers