A Code for Generating Edge Points of a Plane Domain with Complex Geometric Shape

Abstract

In this paper, we set out to implement a code for processing the edges of a plane domain with a complex geometric shape. The algorithm that enabled us to write this code is based on the classical properties of analytic geometry. The coordinates of the vertices of the polygon-like domain must first be given. The code developed automatically generates indices for interior and edge points. Any point located at a distance defined by user from the edge of a domain is considered an edge point. To this condition, we add a second condition that requires the edge point to be inside the circle with a diameter of two consecutive vertices of the polygon. An illustration is included to clarify the readers of this paper.