Issue No. 06 - June (2011 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2010.114
Adarsh Krishnamurthy , University of California Berkeley, Berkeley
Sara McMains , University of California Berkeley, Berkeley
Kirk Haller , SolidWorks Corporation, Concord
We present practical algorithms for accelerating distance queries on models made of trimmed NURBS surfaces using programmable Graphics Processing Units (GPUs). We provide a generalized framework for using GPUs as coprocessors in accelerating CAD operations. By supplementing surface data with a surface bounding-box hierarchy on the GPU, we answer distance queries such as finding the closest point on a curved NURBS surface given any point in space and evaluating the clearance between two solid models constructed using multiple NURBS surfaces. We simultaneously output the parameter values corresponding to the solution of these queries along with the model space values. Though our algorithms make use of the programmable fragment processor, the accuracy is based on the model space precision, unlike earlier graphics algorithms that were based only on image space precision. In addition, we provide theoretical bounds for both the computed minimum distance values as well as the location of the closest point. Our algorithms are at least an order of magnitude faster and about two orders of magnitude more accurate than the commercial solid modeling kernel ACIS.
Minimum distance, closest point, clearance analysis, NURBS, GPU, hybrid CPU/GPU algorithms.
A. Krishnamurthy, S. McMains and K. Haller, "GPU-Accelerated Minimum Distance and Clearance Queries," in IEEE Transactions on Visualization & Computer Graphics, vol. 17, no. , pp. 729-742, 2010.