The algorithm for polygonal networks of cross-linking
The article contains an analytical summary of the main stages of the algorithm for connecting two open polygonal networks with third one. The problems of the search the open polymesh free edge as 3D polyline, a specific subset of connected vertices on both free ends and building the intermediate connecting network which is described in the B.Baumgart’s representation are solved.