Articles liés à Intersection and Decomposition Algorithms for Planar...
Présentation de l'éditeur
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
- ÉditeurCambridge University Press
- Date d'édition2011
- ISBN 10 0521168473
- ISBN 13 9780521168472
- ReliureBroché
- Langueanglais
- Nombre de pages296
Acheter neuf
Afficher cet article
EUR 43,84
EUR 3,50 expédition vers Etats-Unis
Destinations, frais et délais
Résultats de recherche pour Intersection and Decomposition Algorithms for Planar...
Image d'archives
Intersection and Decomposition Algorithms for Planar Arrangements
Edité par
Cambridge University Press, 2011
ISBN 10 : 0521168473
ISBN 13 : 9780521168472
Neuf
Couverture souple
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Feb2215580245958
Quantité disponible : Plus de 20 disponibles
Image d'archives
Intersection and Decomposition Algorithms for Planar Arrangements
Edité par
Cambridge University Press, 2011
ISBN 10 : 0521168473
ISBN 13 : 9780521168472
Neuf
Couverture souple
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780521168472_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Intersection and Decomposition Algorithms for Planar Arrangements
Edité par
Cambridge University Press 2011-11, 2011
ISBN 10 : 0521168473
ISBN 13 : 9780521168472
Neuf
PF
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9780521168472
Quantité disponible : 10 disponible(s)
Image d'archives
Intersection and Decomposition Algorithms for Planar Arrangements (Paperback)
Edité par
Cambridge University Press, Cambridge, 2011
ISBN 10 : 0521168473
ISBN 13 : 9780521168472
Neuf
Paperback
Vendeur : Grand Eagle Retail, Fairfield, OH, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : new. Paperback. 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)-DavenportSchinzel 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9780521168472
Quantité disponible : 1 disponible(s)
Image d'archives
Intersection and Decomposition Algorithms for Planar Arrangements
Edité par
Cambridge University Press, 2011
ISBN 10 : 0521168473
ISBN 13 : 9780521168472
Neuf
Paperback / softback
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 470. N° de réf. du vendeur C9780521168472
Quantité disponible : Plus de 20 disponibles
Image d'archives
Intersection and Decomposition Algorithms for Planar Arrangements
impression à la demandeVendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 293 pages. 9.00x5.20x0.80 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __0521168473
Quantité disponible : 1 disponible(s)
Image d'archives
Intersection and Decomposition Algorithms for Planar Arrangements (Paperback)
Edité par
Cambridge University Press, Cambridge, 2011
ISBN 10 : 0521168473
ISBN 13 : 9780521168472
Neuf
Paperback
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : new. Paperback. 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)-DavenportSchinzel 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. 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9780521168472
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Intersection and Decomposition Algorithms for Planar Arrangements
Edité par
Cambridge University Press, 2011
ISBN 10 : 0521168473
ISBN 13 : 9780521168472
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane. N° de réf. du vendeur 9780521168472
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Intersection and Decomposition Algorithms for Planar Arrangements
Edité par
Cambridge University Press, 2011
ISBN 10 : 0521168473
ISBN 13 : 9780521168472
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 rel. N° de réf. du vendeur 446928488
Quantité disponible : Plus de 20 disponibles
Image d'archives
Intersection and Decomposition Algorithms for Planar Arrangements (Paperback)
Edité par
Cambridge University Press, Cambridge, 2011
ISBN 10 : 0521168473
ISBN 13 : 9780521168472
Neuf
Paperback
Vendeur : AussieBookSeller, Truganina, VIC, Australie
Évaluation du vendeur 3 sur 5 étoiles
Paperback. Etat : new. Paperback. 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)-DavenportSchinzel 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. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. N° de réf. du vendeur 9780521168472
Quantité disponible : 1 disponible(s)