Intersection Decomposition Algorithms Planar by Agarwal Pankaj (30 results)
- Hardcover
Seller: HPB-Red, Dallas, TX, U.S.A.HPB-Red
Contact seller5-star sellerCondition: Used - Good
£ 31.81
£ 2.82 shippingShips within U.S.A.Quantity: 1 available
hardcover. Condition: 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.
- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller4-star sellerCondition: New
£ 44.95
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 43.21
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
£ 41.50
£ 15.49 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: New.
- Softcover
- First Edition
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
£ 51.08
£ 8.13 shippingShips from Ireland to U.S.A.Quantity: Over 20 available
Condition: 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. . . . .
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 65.52
£ 3.00 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. 296.
- Softcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
£ 62.00
£ 7.90 shippingShips within U.S.A.Quantity: Over 20 available
Condition: 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.
- Hardcover
Seller: Fireside Bookshop, Stroud, GLOS, United KingdomFireside Bookshop
Contact seller5-star sellerAssociation member: PBFA
Condition: Used - Very good
£ 65.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Cloth. Condition: Very Good. Dust Jacket Condition: No d/j as Published. Type: Book N.B. Small plain label to front paste. Letter J stamped on title page. No dust jacket. Boards slightly sprung.
- Hardcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: Used
£ 107.80
£ 3.00 shippingShips within U.S.A.Quantity: 1 available
Condition: Used. pp. 294 Index.
- Hardcover
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: Used
£ 110.04
£ 6.50 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: Used. pp. 294 14:B&W 6 x 9 in or 229 x 152 mm Case Laminate on White w/Gloss Lam.
- More images
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 61.40
£ 53.40 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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.
- Hardcover
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: Used
£ 113.97
£ 8.51 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: Used. pp. 294.
- Hardcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 97.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Hardcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller4-star sellerCondition: New
£ 134.85
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 121.47
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Hardcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
£ 143.61
£ 8.13 shippingShips from Ireland to U.S.A.Quantity: Over 20 available
Condition: 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. . . . .
- Hardcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
£ 178.75
£ 7.90 shippingShips within U.S.A.Quantity: Over 20 available
Condition: 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.
- Hardcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 171.75
£ 12.50 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Brand New. 293 pages. 9.50x6.50x1.00 inches. In Stock.
- More images
- Hardcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 183.28
£ 53.81 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: 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 var…ious 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.
- Softcover
- Print on Demand
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 42.46
£ 10.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Brand New. 293 pages. 9.00x5.20x0.80 inches. In Stock. This item is printed on demand.
- Softcover
- Print on Demand
Seller: THE SAINT BOOKSTORE, Southport, United KingdomTHE SAINT BOOKSTORE
Contact seller5-star sellerCondition: New
£ 46.10
£ 15.45 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
£ 64.67
£ 6.50 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: 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.
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
£ 67.10
£ 8.51 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND pp. 296.
- Softcover
- Print on Demand
Seller: CitiRetail, Stevenage, United KingdomCitiRetail
Contact seller5-star sellerCondition: New
£ 48.99
£ 37.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: 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.
- More images
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 49.31
£ 41.91 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: 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 i…n 1991, presents a study of problems rel.
- Hardcover
- Print on Demand
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 132.45
£ 12.50 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: Brand New. 293 pages. 9.50x6.50x1.00 inches. In Stock. This item is printed on demand.
- Hardcover
- Print on Demand
Seller: THE SAINT BOOKSTORE, Southport, United KingdomTHE SAINT BOOKSTORE
Contact seller5-star sellerCondition: New
£ 136.70
£ 16.61 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
- Hardcover
- Print on Demand
Seller: CitiRetail, Stevenage, United KingdomCitiRetail
Contact seller5-star sellerCondition: New
£ 136.49
£ 37.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: 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 proble…ms. 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.
- More images
- Hardcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 138.00
£ 41.91 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: 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 i…n 1991, presents a study of problems rel.
- More images
- Hardcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 143.10
£ 59.88 shippingShips from Germany to U.S.A.Quantity: 5 available
Buch. Condition: Neu. Intersection and Decomposition Algorithms for Planar Arrangements | Pankaj K. Agarwal (u. a.) | Buch | Gebunden | Englisch | 2013 | Cambridge University Press | EAN 9780521404464 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print… on Demand.
