Items related to Intersection and Decomposition Algorithms for Planar...
Synopsis
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.
"synopsis" may belong to another edition of this title.
Book Description
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 1991 book presents a study of problems related to arrangements of lines or curves in the plane.
"About this title" may belong to another edition of this title.
- PublisherCambridge University Press
- Publication date2011
- ISBN 10 0521168473
- ISBN 13 9780521168472
- BindingPaperback
- LanguageEnglish
- Edition number1
- Number of pages296
Search results for Intersection and Decomposition Algorithms for Planar...
Stock Image
Intersection and Decomposition Algorithms for Planar Arrangements
Published by
Cambridge University Press, 2011
ISBN 10: 0521168473
ISBN 13: 9780521168472
New
Softcover
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2215580245958
Quantity: Over 20 available
Stock Image
Intersection and Decomposition Algorithms for Planar Arrangements
Published by
Cambridge University Press 2011-11, 2011
ISBN 10: 0521168473
ISBN 13: 9780521168472
New
PF
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9780521168472
Quantity: 10 available
Stock Image
Intersection and Decomposition Algorithms for Planar Arrangements (Paperback)
Published by
Cambridge University Press, Cambridge, 2011
ISBN 10: 0521168473
ISBN 13: 9780521168472
New
Paperback
Seller: Grand Eagle Retail, Fairfield, OH, U.S.A.
Seller rating 5 out of 5 stars
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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521168472
Quantity: 1 available
Stock Image
Intersection and Decomposition Algorithms for Planar Arrangements
Published by
Cambridge University Press, 2011
ISBN 10: 0521168473
ISBN 13: 9780521168472
New
Paperback / softback
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 470. Seller Inventory # C9780521168472
Quantity: Over 20 available
Stock Image
Intersection and Decomposition Algorithms for Planar Arrangements
Print on DemandSeller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 293 pages. 9.00x5.20x0.80 inches. In Stock. This item is printed on demand. Seller Inventory # __0521168473
Quantity: 1 available
Seller Image
Intersection and Decomposition Algorithms for Planar Arrangements
Published by
Cambridge University Press, 2011
ISBN 10: 0521168473
ISBN 13: 9780521168472
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane. Seller Inventory # 9780521168472
Quantity: 1 available
Seller Image
Intersection and Decomposition Algorithms for Planar Arrangements
Published by
Cambridge University Press, 2011
ISBN 10: 0521168473
ISBN 13: 9780521168472
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
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. Seller Inventory # 446928488
Quantity: Over 20 available
Stock Image
Intersection and Decomposition Algorithms for Planar Arrangements (Paperback)
Published by
Cambridge University Press, Cambridge, 2011
ISBN 10: 0521168473
ISBN 13: 9780521168472
New
Paperback
Seller: AussieBookSeller, Truganina, VIC, Australia
Seller rating 3 out of 5 stars
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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Seller Inventory # 9780521168472
Quantity: 1 available