Free delivery for orders over 69.99 euro.

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 69.99 €

DPD courier 5.99 € Bpost point 7.99 € Bpost 7.49 € DPD point 3.49 € GLS courier 4.49 €

Contact

How to shop

Help

My account

▸ Empty :-(

Free delivery for orders over 69.99 euro.

Intersection and Decomposition Algorithms for Planar Arrangements

Name: Intersection and Decomposition Algorithms for Planar Arrangements
Brand: Cambridge University Press
SKU: 02029781
Price: 155.36 EUR
Availability: InStock
Author: Pankaj K. Agarwal
ISBN: 9780521404464

Pankaj K. Agarwal

Language

English

Book Hardback

Libristo code: 02029781

Publishers Cambridge University Press, April 1991

Several geometric problems can be formulated in terms of the arrangement of a collection of curves i... Full description

Libristo code: 02029781

375 b

155.36 €

In stock at our supplier Shipping in 9-15 days

30-day return policy

Customers also purchased

WAS IN DEN STERNEN STEHT / LIEBESFREUD COMBO-PARTITION+PARTIES SEPAREES ARTHUR ASSBERG_FRITZ Book

binding.

10.73 €

STRING QUARTET NO. 2 OP. 16 MUSIQUE D'ENSEMBLE KURT HESSENBERG Printed items

Sheet music

22.88 €

Míralo de esta manera... MATTEO RAMPIN

Paperback

14.07 €

TOURBE SERRANO PEDRO Book

binding.

16.09 €

Pauvre maison de nos rêves suivi de L'herbe tendre Cendrey

Paperback

16.80 €

The Science of Harry Potter Brake Mark

Hardback

12.65 €

Noticias Historiales Part 1: De Las Conquistas De Tierra Firme En Las Indias Occidentales (1882) Pedro Simon

Paperback

38.27 €

Religión, Tolerancia y Educación Intercultural en Iberoamérica Daniel Valerio Martins

Paperback

14.78 €

Lapbook Mein Körper Svenja Ernsten

Sheet

13.46 €

Indie Jan Filipský

Paperback

7.28 €

Magical Animals Coloring Book: Magical Designs Samantha Snyder

Paperback

8.40 €

Relatos del Laberinto de la Mente C M Villaescusa

Hardback

34.22 €

Expertenwissen Wolfgang Schulz

Paperback

53.16 €

Maria Regina - Zweiter Band Ida von Hahn-Hahn

Paperback

16.20 €

Kommunikation und Konflikt - Eine UEbersicht Sabrina Jung

Paperback

17.11 €

Arbeitsschriften 1/2004 zur EXIT-orientierten Jugendarbeit Bernd Wagner

Paperback

42.83 €

Empfehlungen fur die Digitalisierung, Konvertierung und Publikation von Audio- und Videodokumenten Michael Krischak

Paperback

16.20 €

LAZARILLO DE TORMES + CD (Leer En Espanol Nivel 3) Anonimo

Paperback

16.70 €

Gleinalpe-Leoben-Voitsberg (WK132)

Map

13.76 €

Leseclub Jutta Douvitsas

Paperback

7.59 €

Efektivita sankcionování mladistvých Bronislava Coufalová

Paperback

24.70 €

Several geometric problems can be formulated in terms of the arrangement of a collection of curves in a plane, which has made this one of the most widely studied topics in computational geometry. This book, first published in 1991, 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. Researchers in computational and combinatorial geometry should find much to interest them in this book.