A Prototype of a Bitmap CNC Engraver

Mišel Batmend; Daniela Perdukova; Pavol Fedor

doi:10.4028/www.scientific.net/AMM.613.408

Paper Titles

Application of Hot Gas Powder Sintering in Robotics
p.386

Accuracy of Rapid Prototyped Models with Using of FDM Technology
p.390

New Tendency of Machine Tool Study Based on Virtual Machining Software Applied at University of Oradea
p.396

Simplified Calculation of the Eccentric Press Stiffness
p.402

A Prototype of a Bitmap CNC Engraver
p.408

Implementation of Computer System for Support of Technological Preparation of Production for Technologies of Surface Processing
p.418

Characterization of the Positioning Accuracy and Precision of MEMS Die Servoing Using Model-Based Visual Tracking
p.426

The Structural of the Basic Module for Construction of Modular Machines
p.434

Industry as a Key Factor for Economic Recovery and Competitiveness of the Europe
p.441

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 613A Prototype of a Bitmap CNC Engraver

A Prototype of a Bitmap CNC Engraver

Abstract:

The proposed paper deals with two main ideas. The first is focused on design and realization of CNC engraving machine prototype where are described the principles of its mechanical construction focused on measurements of an electromagnetic diamond percussion tool prototype used for stone engraving describing its basic features and potential applications. The paper includes also chapters about electrical connections design and software/firmware implementation. The second part presents design and implementation of new algorithm for searching the shortest path connecting all bitmap pixels that need to be engraved with respect to specific constraints given by hardware of bitmap CNC engraver. New algorithm considered as a heuristic approximation of Hamiltonian shortest path was implemented and tested on a real prototype of a bitmap CNC engraver. Results of experiments are listed. Concerning a set of 17 real-life bitmaps, the new algorithm saves from 7% up to 17% of overall engraving time compared to original line-by-line tool path.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 613)

Pages:

408-417

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.613.408

Citation:

Cite this paper

Online since:

August 2014

Authors:

Mišel Batmend*, Daniela Perdukova, Pavol Fedor

Keywords:

CNC Engraving Machine, Experimental Measurements, Headstone Engraving, Mechanical Design, Path Optimization, Percussion Tool

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Photomaster - stone image engraving machine, Abra, PL. Information on: www. abra. pl/en.

Google Scholar

[2] PhotoGrab - stone image engraving machine Helios, IT. Information on: www. heliosautomazioni. com.

Google Scholar

[3] N-Graver - stone image engraving machine, Schubert Software, DE. Information on: www. schubert-software. de.

Google Scholar

[4] Photo Marker - stone image engraving machine, Cobalm, IT. Information on: www. cobalm. com.

Google Scholar

[5] G-Tech - stone image engraving machine, Boris Malacko, DE, available online: www. itys. sk.

Google Scholar

[6] G10- stone image engraving machine, Galeks, Acmetek, SRB. Information on: www. acmetek. biz.

Google Scholar

[7] Z12 Monument Etching Laser. Information on: http: /www. kernlasers. com/product_pages/z12. htm.

Google Scholar

[8] V. Monga, N. Damera-Venkata, B. L. Evans, Halftoning toolbox for MATLAB. The University of Texas at Austin. Information on: http: /users. ece. utexas. edu/~bevans/projects/halftoning/toolbox.

Google Scholar

[9] R.C. Gonzalez, P. Wintz, Digital image processing. 2nd edition, Addison-Wesley publishing company, (1987).

Google Scholar

[10] J. F Jarvis, C. N Judice and W. H. Ninke, A Survey of Techniques for the Display of Continuous Tone Pictures on Bi-Level Displays, Computer Graphics and Image Processing, vol. 5 (1976), 13-40.

DOI: 10.1016/s0146-664x(76)80003-2

Google Scholar

[11] D.L. Applegate, R. M. Bixby, V. Chvátal, V. and W. J Cook, The Traveling Salesman Problem: A Computational Study, Princeton University Press, (2006).

DOI: 10.1145/1556154.1556162

Google Scholar

[12] G. J. Woeginger, Exact algorithms for NP-Hard problems: A survey, Combinatorial Optimization – Eureka, Lecture notes in computer science, Springer, vol. 2570 (2003), 185–207.

DOI: 10.1007/3-540-36478-1_17

Google Scholar

[13] B. Chazelle, A minimum spanning tree algorithm with inverse-Ackermann type complexity, Journal of the Association for Computing Machinery, 47/6 (2000), 1028–1047.

DOI: 10.1145/355541.355562

Google Scholar