Geometric Retrieval Problems by Cole Richard (3 results)

PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

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.…