In this paper, a procedure for the application of one computational geometry algorithm in the process of generating hidden cryptographic keys from one segment of a 3D image is presented. The presented procedure consists of three phases. In the first phase, the separation of one segment from the 3D image and determination of the triangulation of the separated polygon are done. In the second phase, a conversion from the obtained triangulation of the polygon in the record that represents the Catalan key is done. In the third phase, the Catalan-key is applied in the encryption of the text based on the balanced parentheses combinatorial problem.
Most algorithms for polygon triangulation do not consider the quality of generated triangles. We present two approaches for modifying the ear-cutting triangulation algorithm so that the resulting mesh contains higher proportion of quality triangles. The first approach is based on searching for the best triangle by scanning the boundary. The second approach uses "stabbing diagonals" to partition the polygon onto components which can then be separately triangulated to increase the number of quality triangles.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.