Order Total (1 Item Items):
Shipping Destination:
Intersection Decomposition Algorithms Planar by Agarwal Pankaj (32 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (32)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (26)
- As New, Fine or Near Fine (1)
- Very Good or Good (2)
- Fair or Poor (No further results match this refinement)
- As Described (3)
Binding
Collectible Attributes
- First Edition (1)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (5)
- Not Print on Demand (19)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
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!
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Condition: New.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 43.21
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press 2011-08-11, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
£ 41.50
£ 15.49 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback. Condition: New.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
First Edition
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. . . . .
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press CUP, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Condition: New. pp. 296.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
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.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Seller: Fireside Bookshop, Stroud, GLOS, United Kingdom
Association Member: PBFA
Seller rating 5 out of 5 stars
Cloth. Condition: 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
Language: English
Published by Cambridge University Press CUP, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Condition: Used. pp. 294 Index.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Condition: 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
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
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.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Condition: Used. pp. 294.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Condition: New.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 121.47
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
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. . . . .
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
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. Condition: Brand New. 293 pages. 9.50x6.50x1.00 inches. In Stock.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
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 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)
Language: English
Published by Cambridge University Press, Cambridge, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
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 multiple locations in the US or from the UK, depending on stock availability.
-
Paperback. Condition: Brand New. 293 pages. 9.00x5.20x0.80 inches. In Stock. This item is printed on demand.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
£ 46.10
£ 15.45 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
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.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
Condition: New. PRINT ON DEMAND pp. 296.
-
Intersection and Decomposition Algorithms for Planar Arrangements (Paperback)
Language: English
Published by Cambridge University Press, Cambridge, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
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.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 0521168473 ISBN 13: 9780521168472
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 in 1991, presents a study of problems rel.
-
Intersection and Decomposition Algorithms for Planar Arrangements (Hardcover)
Language: English
Published by Cambridge University Press, Cambridge, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
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 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.
-
Hardcover. Condition: Brand New. 293 pages. 9.50x6.50x1.00 inches. In Stock. This item is printed on demand.
-
Intersection and Decomposition Algorithms for Planar Arrangements
Language: English
Published by Cambridge University Press, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
£ 136.70
£ 16.61 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
-
Intersection and Decomposition Algorithms for Planar Arrangements (Hardcover)
Language: English
Published by Cambridge University Press, Cambridge, 1991
ISBN 10: 0521404460 ISBN 13: 9780521404464
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 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.
