Synopsis
This book explores the intricacies of calculating minimal distances on arbitrary polyhedral surfaces, employing detailed mathematical explanations and practical applications. Exploring this topic within the context of computational geometry, the author presents an innovative algorithm for finding all minimal distances within polyhedral structures. The book's strength lies in its exploration of how this algorithm can simplify the flattening of complex three-dimensional surfaces. It demonstrates how calculating distances can enable the unfolding and flattening of intricate objects, including surfaces found in nature or designed in engineering. The author provides a thorough examination of the algorithm's complexity and potential limitations, offering insights into the challenges and considerations involved in distance calculations on polyhedral surfaces. Overall, this book is a valuable resource for researchers and practitioners in computational geometry, computer graphics, and related fields, offering both theoretical foundations and practical applications for understanding and manipulating complex three-dimensional structures. Its detailed explanations and illustrative examples make it accessible to a wide range of readers, from students to experienced professionals.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Computing Minimal Distances on Arbitrary Polyhedral...
Seller Image
Computing Minimal Distances on Arbitrary Polyhedral Surfaces (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book explores the intricacies of calculating minimal distances on arbitrary polyhedral surfaces, employing detailed mathematical explanations and practical applications. Exploring this topic within the context of computational geometry, the author presents an innovative algorithm for finding all minimal distances within polyhedral structures. The book's strength lies in its exploration of how this algorithm can simplify the flattening of complex three-dimensional surfaces. It demonstrates how calculating distances can enable the unfolding and flattening of intricate objects, including surfaces found in nature or designed in engineering. The author provides a thorough examination of the algorithm's complexity and potential limitations, offering insights into the challenges and considerations involved in distance calculations on polyhedral surfaces. Overall, this book is a valuable resource for researchers and practitioners in computational geometry, computer graphics, and related fields, offering both theoretical foundations and practical applications for understanding and manipulating complex three-dimensional structures. Its detailed explanations and illustrative examples make it accessible to a wide range of readers, from students to experienced professionals. 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 # 9781333523701_0
Buy New
US$ 17.15
Shipping:
FREE
From United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Computing Minimal Distances on Arbitrary Polyhedral 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-9781333523701
Stock Image
Computing Minimal Distances on Arbitrary Polyhedral 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-9781333523701
Buy New
US$ 23.51
Shipping:
US$ 4.38
From United Kingdom to U.S.A.
Quantity: 15 available