This book delves into the fascinating realm of piecewise linear functions and their envelopes, exploring their applications in computational geometry. The author skillfully navigates through topics such as hidden line/surface elimination, motion planning, transversals of polytopes, and Voronoi diagrams, providing both combinatorial and computational insights. Building upon established combinatorial bounds, the book presents efficient algorithms for calculating envelopes of piecewise linear functions. It delves into special cases and extensions, addressing scenarios where functions intersect or where they are represented by half-hyperplanes or disjoint simplices. The thematic depth of this book lies in its exploration of the intricate relationship between piecewise linear functions and geometric problems. It reveals how envelopes provide a powerful framework for understanding and solving problems in diverse areas of computational geometry. From visualizing complex objects to planning collision-free paths for robots, the book showcases the versatility and practical significance of these mathematical concepts. By bridging the gap between theory and application, this book offers valuable insights into the power of piecewise linear functions as a tool for geometric analysis and algorithm design.
"synopsis" may belong to another edition of this title.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. No Jacket. Print on Demand. Explore how envelopes of piecewise linear functions are computed and used in geometry.This book examines envelopes in multiple variables and shows how to bound their complexity. It explains how to build and analyze upper envelopes, including the idea of projecting and refining to get a convex decomposition. The discussion covers practical algorithms and a range of geometric applications, from motion planning to visibility, with emphasis on three-dimensional cases.- Understand what an envelope is and how it relates to the graphs of piecewise-linear functions- Learn about divide-and-conquer approaches to computing envelopes in three dimensions- See how these ideas apply to motion planning, polyhedra, and terrain problems- Discover how complexity bounds are derived and what they imply for real-world problemsIdeal for readers of computational geometry and algorithm-focused texts who want concrete methods and outcomes. 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 # 9781334264153_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334264153
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334264153
Quantity: 15 available