Fr. 212.40

Intersection and Decomposition Algorithms for Planar Arrangements

English · Hardback

Shipping usually within 2 to 3 weeks (title will be printed to order)

Description

Read more










This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane.

List of contents










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.

Summary

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.

Product details

Authors Pankaj K. Agarwal, Agarwal Pankaj K.
Publisher Cambridge University Press
 
Languages English
Product format Hardback
Released 30.04.2013
 
EAN 9780521404464
ISBN 978-0-521-40446-4
No. of pages 294
Dimensions 157 mm x 235 mm x 20 mm
Weight 580 g
Subject Natural sciences, medicine, IT, technology > Mathematics > Geometry

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.