Formation of the Topologically Connected Polygonal Model in CAM software for CNC machines.

  • Rustam R. Miftakhov Kazan Federal University
  • Evgenij V. Zubkov. Kazan Federal University
Keywords: algorithm, polygonal model, 3D modeling, machine building, CNC machines

Abstract

This document describes a real problem in the field of 3d modeling in automated systems for the preparation of control programs for CNC machines, widely used in machine building companies. The efficiency of the CAM system was improved by guaranteeing the accuracy of the topology and the quality of the polygonal models used. The general algorithm of the solution consists of nine stages to guarantee the flexibility of design and debugging. An experiment was carried out with several polygonal models, which confirmed the correction and efficiency of the developed algorithm. The proposed algorithm has a universal character from the point of view of its use in 3d modeling.

References

S. Bischoff, L. Kobbelt (2005). Structure Preserving CAD Model Repair”, Computer Graphics Forum, vol. 24, №. 3, pp. 527–536.

Information about “SprutCAM”. (Accessed 11.06.2018) http://www.sprut.ru/products-and-solutions/products/sprutcam/?tab=137

T. Ju. (2009). Fixing Geometric Errors on Polygonal Models: A Survey; Journal of Computer Science and Technology, vol. 24, №. 1, pp. 19–29.

R. Miftakhov, E. Zubkov (2017). The optimization of polygons intersection searching using parallel computing”, IITMA: materials collection,. pp. 157–159.

R. Miftakhov, E. Zubkov (2017). Using the caching method for accelerating polygonal models algorithms; Innovations in science and practice, №. 2, pp. 90–94, November 2017.

T. Moller (1997). A Fast Triangle-Triangle Intersection Test; Journal of graphics tools, vol.2, №.2, pp 25-30.

C. Sabharwal, J. Leopold, D. McGeehan (2013). Triangle-Triangle Intersection Determination and Classification to Support Qualitative Spatial Reasoning”, Polibits, vol. 48, pp. 13–22.

A. Skvortsov (2002). Delaunay triangulation and its using. Tomsk: Tomsk university publishing house, P.128.

The definition of “Connected component” in graph theory. (Accessed 11.06.2018). http://enacademic.com/dic.nsf/enwiki/153930

The definition of “Polygon mesh”. (Accessed 11.06.2018). https://en.wikipedia.org/wiki/Polygon_mesh

M. Wagner, U. Labsik, G. Greiner (2003). Repairing non-manifold triangle meshes using simulated annealing; International Journal of Shape Modeling, vol. 9, №. 2, pp. 137–154.

J. Wonhyung, S.Hayong, K.C. Byoung (2004). Self-intersection Removal in Triangular Mesh Offsetting; Computer-Aided Design & Applications, vol. 1, №. 1-4, pp. 477–484.

Published
2018-12-01