Contacto
Como comprar
Entrega
Guia de compras
Intersection and Decomposition Algorithms for Planar Arrangements
Inglês
323 b
Política de devolução de 30 dias
Os clientes também compraram
binding.
8.80
€
/
Capa mole
32.70
€
/
Capa mole
12.45
€
/
Capa mole
14.27
€
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 o livro
Inglês
Ofereça este livro hoje
É fácil
1 Adicione ao carrinho e escolha Entregar como presente ao finalizar a compra 2 Receberá um vale 3 O livro chegará ao endereço do destinatárioTambém pode estar interessado em
/
Capa mole
11.74
€
/
Livro de capa dura
50.63
€
/
Capa mole
34.53
€
Olá! Sou o Libroamiko, o seu conselheiro de livros.
Como posso ajudar?