Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  investigate the problem of approximating a set S of 3D points with co-axisal objects typically from CAD/CAM (namely, cylindrical segments, cones and conical frustums). The objective is to minimize the sum of volumes of these objects (as ll as the number of objects used). The general problem when the objects can have arbitrary axes is strongly NP-hard as a cylindrical segment, a cone and a conical frustum can all degenerate into a line segment.  present a general algorithm which combines a neat doubling search method to decompose S into desired subsets (or components). For each subset S,  present a unified practical approximation algorithm for minimizing the volume of the cone (conical frustum, or cylindrical segment) which encloses points in S. Preliminary empirical results indicate that the algorithm is in fact very accurate.
['Russell Tempero', 'Sergey Bereg', 'Xiangxu Meng', 'Changhe Tu', 'Chenglei Yang', 'Binhai Zhu']
I am writing a research paper on a idea Automatically Approximating 3D Points with Co-Axisal Objects
[{"from": "human", "value": "I am writing a research paper on a idea Automatically Approximating 3D Points with Co-Axisal Objects"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  investigate the problem of approximating a set S of 3D points with co-axisal objects typically from CAD/CAM (namely, cylindrical segments, cones and conical frustums). The objective is to minimize the sum of volumes of these objects (as ll as the number of objects used). The general problem when the objects can have arbitrary axes is strongly NP-hard as a cylindrical segment, a cone and a conical frustum can all degenerate into a line segment.  present a general algorithm which combines a neat doubling search method to decompose S into desired subsets (or components). For each subset S,  present a unified practical approximation algorithm for minimizing the volume of the cone (conical frustum, or cylindrical segment) which encloses points in S. Preliminary empirical results indicate that the algorithm is in fact very accurate."}]