Sinossi
This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Descrizione del libro
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.
Contenuti
Introduction; 1. Davenport–Schinzel sequences; 2. Red-blue intersection detection algorithms; 3. Partitioning arrangements of lines; 4. Applications of the partitioning algorithm; 5. Spanning trees with low stabbing number; Bibliography; Index of symbols; Index of keywords.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Intersection and Decomposition Algorithms for Planar...
Foto dell'editore
Intersection and Decomposition Algorithms for Planar Arrangements
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2215580245958
Compra nuovo
EUR 42,69
EUR 3,41 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Intersection and Decomposition Algorithms for Planar Arrangements (Paperback)
Editore:
Cambridge University Press, Cambridge, 2011
ISBN 10: 0521168473
ISBN 13: 9780521168472
Nuovo
Paperback
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9780521168472
Compra nuovo
EUR 53,47
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Intersection and Decomposition Algorithms for Planar Arrangements
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 293 pages. 9.00x5.20x0.80 inches. In Stock. This item is printed on demand. Codice articolo __0521168473
Compra nuovo
EUR 47,33
EUR 11,42 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Intersection and Decomposition Algorithms for Planar Arrangements
Editore:
Cambridge University Press 2011-11, 2011
ISBN 10: 0521168473
ISBN 13: 9780521168472
Nuovo
PF
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 4 su 5 stelle
PF. Condizione: New. Codice articolo 6666-IUK-9780521168472
Compra nuovo
EUR 46,33
EUR 17,69 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 10 disponibili
Foto dell'editore
Intersection and Decomposition Algorithms for Planar Arrangements
Editore:
Cambridge University Press, 2011
ISBN 10: 0521168473
ISBN 13: 9780521168472
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Codice articolo C9780521168472
Compra nuovo
EUR 51,38
EUR 17,64 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Intersection and Decomposition Algorithms for Planar Arrangements
Editore:
Cambridge University Press CUP, 2011
ISBN 10: 0521168473
ISBN 13: 9780521168472
Nuovo
Brossura
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 296. Codice articolo 26617048
Compra nuovo
EUR 70,02
EUR 3,41 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 4 disponibili
Foto dell'editore
Intersection and Decomposition Algorithms for Planar Arrangements
Print on DemandDa: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
Condizione: New. Print on Demand pp. 296 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Codice articolo 8312199
Compra nuovo
EUR 70,79
EUR 7,42 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 4 disponibili
Foto dell'editore
Intersection and Decomposition Algorithms for Planar Arrangements
Print on DemandDa: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: New. PRINT ON DEMAND pp. 296. Codice articolo 18617042
Compra nuovo
EUR 72,56
EUR 9,95 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 4 disponibili
Foto dell'editore
Intersection and Decomposition Algorithms for Planar Arrangements (Paperback)
Editore:
Cambridge University Press, Cambridge, 2011
ISBN 10: 0521168473
ISBN 13: 9780521168472
Nuovo
Paperback
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9780521168472
Compra nuovo
EUR 55,27
EUR 42,25 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Intersection and Decomposition Algorithms for Planar Arrangements
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: 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. Codice articolo 446928488
Compra nuovo
EUR 53,42
EUR 48,99 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili