Items related to Geometric Retrieval Problems (Classic Reprint)
Synopsis
Three techniques to solve geometric retrieval problems with efficient data structures
This book presents practical methods to answer complex geometric questions quickly. It shows how to balance preprocessing, space, and query time to handle large sets of points in multiple dimensions.
This edition focuses on triangle and wedge retrieval, half-space queries in 3D, and related problems in higher dimensions. It explains how to partition query space, reuse information across nearby regions, and apply divide-and-conquer to break hard problems into smaller ones. The discussion includes clear descriptions of data-structure design, time costs, and space requirements, with many approaches that extend beyond two dimensions.- Three robust techniques for organizing geometric queries: partitioning, coherence, and divide-and-conquer.
- Concrete solutions for triangle retrieval, wedge problems, and half-space retrieval in 2D and 3D.
- Strategies to manage space and preprocessing time while keeping query times practical.
- Extensions to higher dimensions and related retrieval problems, with performance considerations.
"synopsis" may belong to another edition of this title.
Search results for Geometric Retrieval Problems (Classic Reprint)
Seller Image
Geometric Retrieval Problems (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 is a collection of work from the author on geometric retrieval theory. It draws together various techniques from computational geometry to allow for the development of algorithms which can be used to solve problems efficiently, with a particular focus on the complexity of the algorithm in terms of space and time. This book explores algorithmic solutions to geometric retrieval problems, ranging from finding the nearest neighbor among a set of points, to finding all the triangles in a set that intersect a given query triangle. The author presents a unified approach to these problems, using a variety of techniques such as space decomposition, range searching, and divide-and-conquer. The result is a set of algorithms that are both efficient and easy to implement. This book will be of interest to researchers in computational geometry and computer graphics, as well as to anyone interested in efficient algorithms for geometric problems. It is an essential resource for anyone who wants to learn more about this important area of computer science. 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 # 9781330167595_0
Buy New
US$ 17.15
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Geometric Retrieval Problems 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-9781330167595
Stock Image
Geometric Retrieval Problems 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-9781330167595
Buy New
US$ 27.67
US$ 4.39 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available