Items related to Combinatorial Complexity Bounds for Arrangements of...
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces (Classic Reprint) - Softcover
Synopsis
This book explores combinatorial distance problems for finite point sets, an intriguing area of mathematical research with a rich history dating back to the 40s. The author presents upper and lower bounds for extremal problems defined for arrangements of lines, circles, spheres and similar curves and surfaces, extending previous results in exciting new ways. The book stands out for its clever adaptations of probabilistic counting, Davenport-Schinzel sequences, and elegant geometric and topological arguments. Ultimately, it sheds new light on the interplay between combinatorial arrangements and the distances between objects, offering valuable insights for further research in discrete and computational geometry.
"synopsis" may belong to another edition of this title.
Buy New
View this item
US$ 17.75
FREE shipping from United Kingdom to U.S.A.
Destination, rates & speedsSearch results for Combinatorial Complexity Bounds for Arrangements of...
Seller Image
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book explores combinatorial distance problems for finite point sets, an intriguing area of mathematical research with a rich history dating back to the 40s. The author presents upper and lower bounds for extremal problems defined for arrangements of lines, circles, spheres and similar curves and surfaces, extending previous results in exciting new ways. The book stands out for its clever adaptations of probabilistic counting, Davenport-Schinzel sequences, and elegant geometric and topological arguments. Ultimately, it sheds new light on the interplay between combinatorial arrangements and the distances between objects, offering valuable insights for further research in discrete and computational geometry. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781333690045_0
Quantity: Over 20 available
Stock Image
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333690045
Quantity: 15 available
Stock Image
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333690045
Quantity: 15 available