Triangulation of plane domain by grinding method defined by system of inequalities

Abstract

The integration of computer technologies in all spheres of human life, casual and professional, is becoming more and more relevant at present. In this regard, rapid development of new means and methods of problem solving through the use of digital and information technologies occurs. One of the most topical spheres of development is computer geometry. Nowadays, there is a number of problems to be solved in this area, one of which is triangulation of plain domains by grinding, defined by a system of inequalities. The main purpose of the presented article is the development and software implementation of a triangulation algorithm based on the grinding method for a plain domain defined by a system of inequalities. This work analyzes various triangulation algorithms, including the algorithm of grinding of a plain domain defined by a system of inequalities. This work considers the application’s function scheme and its implementation. The theoretical significance of the study is the exploration of general concepts, properties, and algorithms of triangulation. The practical significance of the study consists in giving a software implementation of the algorithm of plane domain grinding. Researchers can use the results of this work in subsequent studies that use triangulation for plane domain grinding.