Intersection and Decomposition Algorithms for Planar Arrangements

Klappentext This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane. Zusammenfassung 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. Inhaltsverzeichnis Introduction; 1. Davenport-Schinzel sequences; 2. Red-blue intersection detection algorithms; 3. Partitioning arrangements of lines; 4. Applications of the partitioning algorithm; 5. Spanning trees with low stabbing number; Bibliography; Index of symbols; Index of keywords.

Dettagli sul prodotto

• Autori: Pankaj K. Agarwal, Pankaj K. (Duke University Agarwal, Agarwal Pankaj K.
• Editore: Cambridge University Press ELT
• Lingue: Inglese
• Formato: Tascabile
• Pubblicazione: 11.08.2011
• EAN: 9780521168472
• ISBN: 978-0-521-16847-2
• Pagine: 296
• Categorie: Scienze naturali, medicina, informatica, tecnica > Matematica > Geometria; MATHEMATICS / Combinatorics, Combinatorics & graph theory, Combinatorics and graph theory