Research And Implementation Of Convex Hull Algorithm Of Device Gamut Boundary Description

Given the accuracy of the convex hull algorithm of description gamut boundary higher than Segment Maxima Gamut Boundary Descriptor(SMGBD),and the 3D convex hull algorithms code of some of the existing mainstream computing software on the market is not open,3D convex hull theory in computational geometry is introduced into device gamut boundary description in this paper,and the device gamut boundary visualization tools is developed,mainly to complete the following work:(1)In order to be more realistic description of the color gamut boundary,this paper introduced 3D convex hull theory in computational geometry.The theory includes:3D Gift-Wrapping algorithm,3D Incremental algorithm,3D quick convex hull algorithm,3D Divide and Conquer algorithm.(2)3D Gift-Wrapping algorithm,3D Incremental algorithm,3D quick convex hull algorithm,3D Divide and Conquer algorithm are analyzed in theory,and the conclusion that this four kinds of convex hull algorithm can find more boundary points and obtained gamut boundary closer to the real color gamut boundary.(3)In VS2010 development environment using C++programming,developed a more systematic visualization tools of device gamut boundary description.The display and printer device experiment has verified the effectiveness and practicality of the tool.By comparing the accuracy and time efficiency of the different algorithms in the same input,found that the gamut shells obtained by using three kinds of 3D convex hull algorithm,its accuracy is higher than SMGBD,in which the 3D quick convex hull algorithm precision is the highest;three kinds of 3D convex hull algorithm in time efficiency from high to low are 3D quick convex hull algorithm,3D Gift-Wrapping algorithm,3D Incremental algorithm.In the practical application according to the different requirements of accuracy and time efficiency,select the appropriate gamut boundary description algorithm.