Algorithmization of solving geometric modeling problems is closely related to a complex of applied research. The article shows the advantages of the automated approach of logic programming in matters of geometric modeling in comparison with standard approaches. The research is based on the systematization of projection models of a four-dimensional space of a class of homogeneous and equally connected discrete-continuous structures. The rationale for the relevance of developing algorithms for creating computer-aided design systems for geometric shapes using software tools that provide graphical and grapho-analytical solutions is presented. The options for applying the principles of logic programming in solving geometric problems are outlined. Examples of solving problems on models of four-dimensional space in three flat fields are given. Attention is focused on solving similar problems for higher-dimensional spaces with testing using the example of solving multidimensional analogues of the Apollonius problem. Other projection models of multidimensional projective space are considered. It is established that this algorithm for solving the projection problem makes it possible to speed up and automate the construction of projection models of n-dimensional space and increase the visibility of the construction. The results of the study can form the basis for the development of new interfaces for interaction with geometric structures for solving surface design problems. The properties and methods of declarative programming in the construction of geometric models are defined. A software solution has been defined for working with geometric models in terms of automating the construction process, analyzing the algorithm content, searching, visualizing the result, and storing geometric information. The results of generating a solution to the Apollonius problem are presented, as well as a sample declarative program for running in the Simplex software environment (https://voloshinov. ru/simplex/), the Logic module.
Волошинов et al. (Wed,) studied this question.