Loading...
Please wait, while we are loading the content...
Similar Documents
Arrangements of arcs and pseudocircles (1996).
| Content Provider | CiteSeerX |
|---|---|
| Author | Linhart, Johann Yang, Yanling |
| Abstract | . Arrangements of (pseudo-)circles have already been studied in connection with algorithms in computational geometry. Thereby information on the numbers v k of intersection points contained in k circles seems to be particularly interesting. On each circle, there is an induced arrangement of arcs. This is why we begin by studying arrangements of arcs, and we arrive at a complete characterization of the "v-vectors" (v 0 ; : : : ; v n\Gamma1 ) in this case. For arrangements of pseudocircles, a sharp upper bound on P ik v i is derived, which leads to interesting "extremal" arrangements. Introduction By an arrangement of circles we mean a finite set of circles in the plane such that no two of them touch each other. For combinatorial investigations it seems to be natural to consider more generally a finite set of simple closed Jordan curves, such that any two of them either are disjoint or intersect in exactly two points where they cross each other. This is what we call an arrange... |
| File Format | |
| Publisher Date | 1996-01-01 |
| Access Restriction | Open |
| Subject Keyword | Finite Set Computational Geometry Complete Characterization Induced Arrangement Sharp Upper Bound Thereby Information Combinatorial Investigation Extremal Arrangement Jordan Curve Intersection Point |
| Content Type | Text |
