Artículos relacionados a Geometric Retrieval Problems (Classic Reprint)
Sinopsis
Excerpt from Geometric Retrieval Problems
Polygon Intersection [ekm]: X is a set of polygons; a query is a polygon P, and the answer is the set consisting of those polygons which intersect P.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sinopsis" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 15,05
GRATIS gastos de envío desde Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Geometric Retrieval Problems (Classic Reprint)
Imagen del vendedor
Geometric Retrieval Problems (Classic Reprint)
Impresión bajo demandaLibrería: Forgotten Books, London, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: 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. Nº de ref. del artículo: 9781330167595_0
Gastos de envío:
GRATIS
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Geometric Retrieval Problems Classic Reprint
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781330167595
Cantidad disponible: 15 disponibles
Imagen de archivo
Geometric Retrieval Problems Classic Reprint
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781330167595
Gastos de envío:
EUR 3,77
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 15 disponibles