Importo totale (1 articolo articoli):
Destinazione ordine:
intersection decomposition algorithms planar di agarwal pankaj (34 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (34)
- 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 (31)
- Come nuovo, Ottimo o Quasi ottimo (1)
- Molto buono o Buono (2)
- Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
- Come descritto (Nessun altro risultato corrispondente a questo perfezionamento)
Legatura
Ulteriori caratteristiche
- Prima ed. (Nessun altro risultato corrispondente a questo perfezionamento)
- Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (6)
- Non Print on Demand (20)
Lingua (1)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New.
-
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 (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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
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: New. 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 51,14
EUR 7,43 shipping
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. 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-11, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 46,35
EUR 17,70 shipping
Spedito da Regno Unito a U.S.A.Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
-
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 52,70
EUR 9,95 shipping
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 294.
-
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, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: Basi6 International, Irving, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Intersection And Decomposition Algorithms For Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
EUR 86,52
Spedizione gratuita
Spedito da Australia a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
EUR 97,94
Spedizione gratuita
Spedito da Australia a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
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 76,49
EUR 28,56 shipping
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, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Lingua: Inglese
Editore: Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
EUR 67,06
EUR 62,42 shipping
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: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 114,14
EUR 28,56 shipping
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 5 su 5 stelle
EUR 146,01
Spedizione gratuita
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
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. 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 192,41
EUR 14,28 shipping
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 184,68
EUR 62,90 shipping
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
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 47,35
EUR 11,42 shipping
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 51,40
EUR 17,65 shipping
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 70,83
EUR 7,43 shipping
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,56
EUR 9,95 shipping
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 55,29
EUR 42,27 shipping
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 53,42
EUR 48,99 shipping
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 (Paperback)
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 5 su 5 stelle
EUR 76,58
EUR 31,60 shipping
Spedito da Australia 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 Sydney, NSW warehouse or from our UK or US warehouse, 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 56,25
EUR 70,00 shipping
Spedito da Germania a U.S.A.Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Intersection and Decomposition Algorithms for Planar Arrangements | Pankaj K. Agarwal | Taschenbuch | Kartoniert / Broschiert | Englisch | 2011 | Cambridge University Press | EAN 9780521168472 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 148,08
EUR 14,28 shipping
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 152,84
EUR 18,98 shipping
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 586.
