Geometric Retrieval Problems by Cole Richard (5 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.

Buch. Condition: Neu. Neuware - This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work. This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.

Gebunden. Condition: New.

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.