Journal
COMPUTER-AIDED DESIGN
Volume 45, Issue 2, Pages 321-330Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.cad.2012.10.015
Keywords
Offsetting; Structured points; Approximation; Highly parallel; Layered Depth Images
Categories
Funding
- Hong Kong RGC/GRF [CUHK/417508, CUHK/417109, CUHK/2050518]
- NSF [1000579, 1117127]
- Directorate For Engineering
- Div Of Civil, Mechanical, & Manufact Inn [1000579] Funding Source: National Science Foundation
- Div Of Information & Intelligent Systems
- Direct For Computer & Info Scie & Enginr [1117127] Funding Source: National Science Foundation
Ask authors/readers for more resources
We present an efficient algorithm to perform approximate offsetting operations on geometric models using GPUs. Our approach approximates the boundary of an object with point samples and computes the offset by merging the balls centered at these points. The underlying approach uses Layered Depth Images (LDI) to organize the samples into structured points and performs parallel computations using multiple cores. We use spatial hashing to accelerate intersection queries and balance the workload among various cores. Furthermore, the problem of offsetting with a large distance is decomposed into successive offsetting using smaller distances. We derive bounds on the accuracy of offset computation as a function of the sampling rate of LDI and offset distance. In practice, our CPU-based algorithm can accurately compute offsets of models represented using hundreds of thousands of points in a few seconds on a GeForce GTX 580 CPU. We observe more than 100 times speedup over prior serial CPU-based approximate offset computation algorithms. (C) 2012 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available