Importo totale (1 articolo articoli):
Destinazione ordine:
intersection decomposition algorithms planar di agarwal pankaj (32 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (32)
- Riviste e Giornali (Nessun altro risultato corrispondente a questo perfezionamento)
- Fumetti (Nessun altro risultato corrispondente a questo perfezionamento)
- Spartiti (Nessun altro risultato corrispondente a questo perfezionamento)
- Arte, Stampe e Poster (Nessun altro risultato corrispondente a questo perfezionamento)
- Fotografie (Nessun altro risultato corrispondente a questo perfezionamento)
- Mappe (Nessun altro risultato corrispondente a questo perfezionamento)
- Manoscritti e Collezionismo cartaceo (Nessun altro risultato corrispondente a questo perfezionamento)
Condizioni Maggiori informazioni
- Nuovo (26)
- Come nuovo, Ottimo o Quasi ottimo (1)
- Molto buono o Buono (2)
- Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
- Come descritto (3)
Legatura
Ulteriori caratteristiche
- Prima ed. (1)
- Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (5)
- Non Print on Demand (19)
Lingua (1)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
hardcover. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 4 su 5 stelle
EUR 51,79
Spedizione gratuita
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 51,56
Spedizione EUR 13,88
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press 2011-08-11, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 49,52
Spedizione EUR 17,94
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
Prima edizione
EUR 57,97
Spedizione EUR 10,50
Spedito da Irlanda a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane. Num Pages: 296 pages, black & white illustrations. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 231 x 162 x 19. Weight in Grams: 44. . 2011. 1st Edition. paperback. . . . .
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press CUP, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 296.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 71,43
Spedizione EUR 9,10
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane. Num Pages: 296 pages, black & white illustrations. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 231 x 162 x 19. Weight in Grams: 44. . 2011. 1st Edition. paperback. . . . . Books ship from the US and Ireland.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: Fireside Bookshop, Stroud, GLOS, Regno Unito
Membro dell'associazione: PBFA
Valutazione del venditore 5 su 5 stelle
EUR 77,55
Spedizione EUR 28,96
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCloth. Condizione: Very Good. Type: Book N.B. Small plain label to front paste. Letter J stamped on title page. No dust jacket. Boards slightly sprung.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press CUP, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: Used. pp. 294 Index.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 123,93
Spedizione EUR 7,53
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Used. pp. 294 14:B&W 6 x 9 in or 229 x 152 mm Case Laminate on White w/Gloss Lam.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
EUR 64,86
Spedizione EUR 62,42
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
EUR 122,72
Spedizione EUR 9,95
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Used. pp. 294.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 115,73
Spedizione EUR 28,96
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 4 su 5 stelle
EUR 155,37
Spedizione gratuita
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 144,92
Spedizione EUR 13,88
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
EUR 162,98
Spedizione EUR 10,50
Spedito da Irlanda a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane. Num Pages: 294 pages, black & white illustrations. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 239 x 170 x 17. Weight in Grams: 556. . 1991. hardcover. . . . .
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 205,94
Spedizione EUR 9,10
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane. Num Pages: 294 pages, black & white illustrations. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 239 x 170 x 17. Weight in Grams: 556. . 1991. hardcover. . . . . Books ship from the US and Ireland.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 203,41
Spedizione EUR 14,48
Spedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 293 pages. 9.50x6.50x1.00 inches. In Stock.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
EUR 174,45
Spedizione EUR 62,90
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
Intersection and Decomposition Algorithms for Planar Arrangements (Paperback)
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 50,65
Spedizione EUR 11,58
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 293 pages. 9.00x5.20x0.80 inches. In Stock. This item is printed on demand.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 55,00
Spedizione EUR 17,90
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 71,98
Spedizione EUR 7,53
Spedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Aggiungi al carrelloCondizione: 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.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
EUR 72,75
Spedizione EUR 9,95
Spedito da Germania a U.S.A.Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 296.
-
Intersection and Decomposition Algorithms for Planar Arrangements (Paperback)
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 58,45
Spedizione EUR 42,86
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloPaperback. 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.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
EUR 55,96
Spedizione EUR 48,99
Spedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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.
-
Intersection and Decomposition Algorithms for Planar Arrangements (Hardcover)
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: new. Hardcover. This book 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. This book presents a study of various problems related to arrangements of lines, segments, or curves in the plane. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 158,02
Spedizione EUR 14,48
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 293 pages. 9.50x6.50x1.00 inches. In Stock. This item is printed on demand.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 163,10
Spedizione EUR 19,24
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
-
Intersection and Decomposition Algorithms for Planar Arrangements (Hardcover)
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 162,84
Spedizione EUR 42,86
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: new. Hardcover. This book 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. This book presents a study of various problems related to arrangements of lines, segments, 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.
