Contacto
Cómo comprar
Entrega
Guía de compras
Intersection and Decomposition Algorithms for Planar Arrangements
Inglés
127 b
Hasta 30 días para devoluciones
Clientes que también han comprado
/
Tapa blanda
22.69
€
/
Tapa blanda
14.19
€
/
Tapa blanda
21.99
€
/
Tapa blanda
38.49
€
/
Tapa blanda
26.49
€
/
Tapa dura
39.90
€
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.
Sobre el libro
Inglés
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Tapa blanda
38.49
€
/
Tapa blanda
10.69
€
/
Tapa blanda
10.69
€
/
Tapa blanda
10.69
€
/
Tapa blanda
16.39
€
/
Tapa blanda
29.89
€
/
Tapa blanda
20.09
€
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?