Produkt mají v nabídce:
Intersection and Decomposition Algorithms for Planar Arrangements - Agarwal, Pankaj K. (Duke University, North Carolina)
Several geometric problems can be formulated in terms of the arrangements of a collection of curves in a plane, making this one of the most widely studied topics in computational geometry. This book, first published in 1991, presents a study of problems related to arrangements of lines or curves in the plane.
