Mathematical Analysis - General & Miscellaneous, Geometry - General & Miscellaneous, Computer Mathematics, Computer Science & Combinatorics, Mathematical Programming & Operations Research

Intersection and Decomposition Algorithms for Planar Arrangements

Name: Intersection and Decomposition Algorithms for Planar Arrangements
Author: Pankaj K. Agarwal
ISBN: 9780521168472

by Pankaj K. Agarwal

Available on Bookshop Write a review

Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.

Overview

This book presents a study of various problems related to arrangements of lines, segments, or curves in the plane. The first problem is a proof of almost tight bounds on the length of (n,s)-Davenport-Schinzel sequences, a technique for obtaining optimal bounds for numerous algorithmic problems. Then the intersection problem is treated. The final problem is improving the efficiency of partitioning algorithms, particularly those used to construct spanning trees with low stabbing numbers, a very versatile tool in solving geometric problems. A number of applications are also discussed.