Items related to Robotics Research Technical Report: Linear Time Algorithms...
Robotics Research Technical Report: Linear Time Algorithms for Visibility and Shortest Path, Problems Inside Simple Polygons (Classic Reprint) - Softcover
Synopsis
Unlock fast solutions for visibility and shortest paths inside simple polygons.
This work presents new linear-time algorithms that build on a triangulation of the polygon to solve key geometric problems. It offers practical methods and data structures that enable fast queries and preprocessing for complex polygon scenes.
The book shows how to compute a shortest path tree from a fixed point, determine which parts of the polygon are visible from a given edge or point, and perform fast shooting queries that find where a ray first hits the boundary. It also covers hierarchical decompositions, hourglass structures, and convex rope calculations, all designed to run in linear time with careful data organization. The results extend the state of the art in linear-time polygon processing and connect visibility with shortest-path problems through concrete algorithms and proofs.- Learn how to build a shortest-path tree inside a simple polygon in linear time
- See how to preprocess a polygon for logarithmic-time visibility and shooting queries
- Explore hierarchical decompositions and hourglass structures used in fast computations
- Discover the convex rope approach to reachability and related geometric problems
"synopsis" may belong to another edition of this title.
Search results for Robotics Research Technical Report: Linear Time Algorithms...
Stock Image
Robotics Research Technical Report (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 presents efficient algorithms based on recent advances to solve fundamental problems in computational geometry. It introduces a novel approach to solving problems that involve distance calculations, visibility, and path planning within simple polygons. The text provides a self-contained account of the author's original research and is an ideal introduction to this emerging and vibrant area of study. Its linear-time algorithms will be of interest to researchers and practitioners of computational geometry, as well as algorithmists, graph theorists, and programmers facing geometric problems. 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 # 9781332151653_0
Buy New
US$ 17.58
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Robotics Research Technical Report Linear Time Algorithms for Visibility and Shortest Path, Problems Inside Simple Polygons 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-9781332151653
Stock Image
Robotics Research Technical Report Linear Time Algorithms for Visibility and Shortest Path, Problems Inside Simple Polygons 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-9781332151653
Buy New
US$ 28.59
US$ 4.46 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available