Intersection and Decomposition Algorithms for Planar Arrangements

Intersection and Decomposition Algorithms for Planar Arrangements

MIA KARTS BOOKS

Intersection and Decomposition Algorithms for Planar Arra...
Skip to product information
Sold out

    Intersection and Decomposition Algorithms for Planar Arrangements

    £71.00 GBP
     per 
    Currently unavailable

    Book Details

    Format
    Paperback
    Language
    English
    Category
    Geometry & Topology
    Condition
    Used
    ISBN-13
    9780521168472
    ISBN-10
    0521168473

    Free U.S. shipping on all orders. International shipping is calculated at checkout.

    Guaranteed safe checkout

    Product description

    ISBN: 0521168473

    Author: Agarwal, Pankaj K.

    Condition: Used

    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.

    View full details

    Intersection and Decomposition Algorithms for Planar Arrangements

    £71.00 GBP
     per 
    RECENTLY VIEWED PRODUCTS

    Why Shop Miakarts Books?

    Wide Selection

    Discover books across many categories and subjects.

    Secure Checkout

    Shop with a secure online checkout experience.

    Detailed Book Information

    View ISBN, author, publisher, format and other available book details.

    Easy Online Ordering

    Browse, select and order books online.

    Customer Support

    Contact us if you need help with an order or product.