Arrangements of Curves in the Plane Topology Combinatorics And Algorithms
Arrangements of Curves in the Plane Topology Combinatorics And Algorithms
Herbert Edelsbrunner
The book Arrangements of Curves in the Plane Topology Combinatorics And Algorithms was written by author Herbert Edelsbrunner Here you can read free online of Arrangements of Curves in the Plane Topology Combinatorics And Algorithms book, rate and share your impressions in comments. If you don't know what to write, just answer the question: Why is Arrangements of Curves in the Plane Topology Combinatorics And Algorithms a good or bad book?
What reading level is Arrangements of Curves in the Plane Topology Combinatorics And Algorithms book?
To quickly assess the difficulty of the text, read a short excerpt:
Note that in this case 7, 7^7^ intersect in at most 5 =2 points if we assume general position (see [KLPS] for a more precise statement of this condition and for a proof of this property). -3- Many other problems can be reduced to the analysis of an arrangement of curves. This is the case, for example, when the objects under consideration can be parametrized as points in the plane, and certain properties of such an object vary discontinuously as it crosses certain "critical curves". The arrangem...ent of these curves partitions the plane into "non-critical regions", and construction of these regions is often required to obtain a discrete combinatorial representation of all possi- ble problem states. Such examples, involving motion planning problems, can be found in [SSl], [KO], [MO], [GSS]. A special case of arrangements "which has been studied extensively in the past is that of lines. An important property of such arrangements is the so-called "Zone Theorem" (see [CGL], [EOS], [Ed]) which states the following.
User Reviews: