Partitioning Arrangements of Lines, Vol. 2 (Classic Reprint): Applications: Applications (Classic Reprint) - Softcover

Inhaltsangabe

This book takes a deep dive into partitioning techniques for line and line segment arrangements, presenting efficient deterministic algorithms for a range of problems, including: computing incidences between points and lines, computing faces in arrangements of lines, counting segment intersections, reporting red-blue intersections, and determining spanning trees with a low stabbing number. By partitioning the plane into triangles such that no triangle meets more than a certain number of lines, the author develops a fast and effective divide-and-conquer approach to these problems. Moreover, the author provides a detailed discussion of the underlying geometric concepts, making this book a valuable resource for researchers and practitioners working on computational geometry and related fields.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.