Determination of cutting positions of honeycomb blocks using computer vision
Not on the map. Why?
Abstract (arXiv)
The article discusses a method for automating the process of cutting a honeycomb block, and specifically obtaining points and cutting angles for the required faces. The following requirements are taken into account in the calculations: the allowable location of the cut plane is 0.4 of the length of the cell face, the cut plane must be perpendicular to the cell wall. The algorithm itself consists of two main stages: determining the honeycomb structure and searching for cut points. In the absence of significant defects in honeycomb blocks (deformation of the cell profile and a dent on the edges of the cells), the structure determination algorithm works without significant inaccuracies. The results of the cut point search algorithm can be considered satisfactory.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 4 references that are in the map. First posted on arXiv 11 Jan 2023.
Builds on
1 of 4 references.
References · 1
Built on by
Not cited yet.