Convex polygons

Lecture Computer graphics - Lesson 9: Filled area primitives II. The main topics covered in this chapter include: scan-line polygon filling, boundary-fill and flood-fill, polygon types, convex polygons, complex polygons, unfilled polygon, filled polygons, even number of edges,...

64p youzhangjing_1909 28-04-2022 12 4   Download

An imitating model of concrete is proposed in the form of a two-component system consisting of a matrix and inclusions - porous aggregate grains simulated by convex polygons.

7p vimante2711 05-03-2020 8 1   Download

In this paper an algorithm for the convex polygon triangulation based on the reverse Polish notation is proposed. The formal grammar method is used as the starting point in the investigation. This idea is "translated" to the arithmetic expression field enabling application of the reverse Polish notation method.

7p vinguyentuongdanh 20-12-2018 25 1   Download

A polygon is said to be simple if its nonadjacent sides do not have common interior or endpoints. A polygon is said to be convex if it lies on one side of any straight line passing through two neighboring vertices (Fig. 3.13c). In what follows, we consider only plane simple convex polygons.

7p phuongthanh3 28-09-2010 52 1   Download

A polygon is said to be plane if its vertices are coplanar. A polygon is said to be simple if its nonadjacent sides do not have common interior or endpoints. A polygon is said to be convex if it lies on one side of any straight line passing through two neighboring vertices (Fig. 3.13c). In what follows, we consider only plane simple convex polygons.

7p phuongthanh3 28-09-2010 58 2   Download