GPU-Accelerated Minimum Distance and Clearance Queries
نویسندگان
چکیده
منابع مشابه
Accelerated Computation of Minimum Enclosing Balls by GPU Parallelization and Distance Filtering
Minimum enclosing balls are used extensively to speed up multidimensional data processing in, e.g., machine learning, spatial databases, and computer graphics. We present a case study of several acceleration techniques that are applicable in enclosing ball algorithms based on repeated farthest-point queries. Parallel GPU solutions using CUDA are developed for both lowand high-dimensional cases....
متن کاملMinimum Distance Queries for Haptic Rendering
Finding the closest points between two modeled objects is a fundamental operation in robotics, computer graphics, and computational geometry. This dissertation is motivated by the use of distance functions in haptic interfaces for virtual prototyping, where distance measures provide the basis for forces that are applied to a human user. The requirements for haptic interfaces mean that these dis...
متن کاملShortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures
We develop an efficient parallel algorithm for answering shortestpath queries in planar graphs and implement it on a multi-node CPU/GPU clusters. The algorithm uses a divide-and-conquer approach for decomposing the input graph into small and roughly equal subgraphs and constructs a distributed data structure containing shortest distances within each of those subgraphs and between their boundary...
متن کاملgProximity: Hierarchical GPU-based Operations for Collision and Distance Queries
We present novel parallel algorithms for collision detection and separation distance computation for rigid and deformable models that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data parallelism to perform fast hierarchy construction, updating, and traversal using tight-fitting bounding volumes such as oriented bounding boxes (OBB) and rectangular swep...
متن کاملGPU Accelerated Self-join for the Distance Similarity Metric
The self-join finds all objects in a dataset within a threshold of each other defined by a similarity metric. As such, the self-join is a building block for the field of databases and data mining, and is employed in Big Data applications. In this paper, we advance a GPU-efficient algorithm for the similarity self-join that uses the Euclidean distance metric. The search-and-refine strategy is an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Visualization and Computer Graphics
سال: 2011
ISSN: 1077-2626
DOI: 10.1109/tvcg.2010.114