• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.3
• /
• pp.253-258
• /
• 2015

The 3D printing is any of various processes for making a three dimensional object of almost any shape from a 3D model. Recently, a rapidly expanding hobbyist and home-use market has become established with the inauguration of the open-source RepRap and Fab@Home projects. However, this causes problems regarding copyright protection and usage of illegal 3D data. In this paper, we developed a 3D printing open-market system, which guarantees copyright protection using the remote 3D printing without direct distribution of 3D design data. Because most of the home-use 3D printers are FFF (Fused Filament Fabrication) based on NC code system, open-market system uses FFF 3D printers. Also, open-market system inspects the uploaded 3D model data, so the system can prevent distribution of illegal model data such as weapons, etc.

• Journal of Korea Multimedia Society
• /
• v.20 no.12
• /
• pp.1951-1959
• /
• 2017

Due to the fact that 3D printing is applied to many areas of life, 3D printing models are often used illegally without any permission from the original providers. This paper presents a novel watermarking algorithm for the copyright protection and ownership identification for 3D printing based on the radius curvature of 3D triangle. 3D triangles are extracted and classified into groups based on radius curvature by the clustering algorithm, and then the mean radius curvature of each group will be computed for watermark embedding. The watermark data is embedded to the groups of 3D triangle by changing the mean radius curvature of each group. In each group, we select a 3D triangle which has the nearest radius curvature with the changed mean radius curvature. Finally, we change the vertices of the selected facet according to the changed radius curvature has been embedded watermark. In experiments, the distance error between the original 3D printing model and the watermarked 3D printing model is approximate zero, and the Bit Error Rate is also very low. From experimental results, we verify that the proposed algorithm is invisible and robustness with geometric attacks rotation, scaling and translation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3950-3964
• /
• 2017

With the increasing popularity of 3D technology such as 3D printing, 3D modeling, etc., there is a growing need to search for similar models on the internet. Matching non-rigid shapes has become an active research field in computer graphics. In this paper, we present an efficient and effective non-rigid model retrieval method based on topological structure and local volume. The integral geodesic distances are first calculated for each vertex on a mesh to construct the topological structure. Next, each node on the topological structure is assigned a local volume that is calculated using the shape diameter function (SDF). Finally, we utilize the Hungarian algorithm to measure similarity between two non-rigid models. Experimental results on the latest benchmark (SHREC' 15 Non-rigid 3D Shape Retrieval) demonstrate that our method works well compared to the state-of-the-art.