19. Smol’janov A. G., Smol’janova E. G. Clipping problem and planar convex polygon

UDK 519.8

CLIPPING PROBLEM AND PLANAR CONVEX POLYGON

Smol’yanov Andrey Grigoryevich (associate professor (docent), head of Fundamental Informatics chair of Mathematics and Information Technology Department of Ogarev Mordovia State University (Saransk, Russia), Kandidat Nauk (PhD) degree holder in Physical and Mathematical sciences, This email address is being protected from spambots. You need JavaScript enabled to view it.)

Smol’yanova Elena Grigoryevna (associate professor (docent) of Mathematical Analysis chair of Mathematics and Information Technology department of Ogarev Mordovia State University (Saransk, Russia), This email address is being protected from spambots. You need JavaScript enabled to view it.)

The paper provides the clipping algorithm for planar convex polygon problem. The algorithm is based on the classification of the vertices of an arbitrary planar figure relative to a convex polygon. In many cases this classification allows to avoid unnecessary calculations such as calculating of coordinates for points of the intersection of arbitrary figure sides with polygon sides.

Keywords: clipping problem, convex polygon, computer program.

For citation: Smol’janov A. G., Smol’janova E. G. Zadacha otsechenija i proizvol’noe vypukloe okno [Clipping problem and planar convex polygon]. Vestnik Mordovskogo Universiteta – Mordovia University Bulletin. 2014, no. 1, pp. 132 – 138.

This work is licensed under a Creative Commons Attribution 4.0 License.