Method and device for rendering concave polygon

Abstract

The invention discloses a method and device for rendering a concave polygon. The method for rendering the concave polygon comprises the following steps of: segmenting the concave polygon into a plurality of convex polygons; judging that pixels to be rendered are positioned whose convex polygons; acquiring parameter information for rendering the pixels by using coordinate information of the pixels and coordinate information and parameter information of each apex of the convex polygon on which the pixels are positioned; and rendering the pixels by using the parameter information.

Description

technical field [0001] The present invention relates to the field of graphics processing, and more particularly to a method and device for rendering concave polygons. Background technique [0002] Efficiently rendering concave polygons is very difficult in computer graphics. Since a concave polygon has no specific shape and the number of vertices is at least 4 and at most infinite, it is not easy to judge whether a pixel is in a concave polygon. Also, it is difficult to render concave polygons using methods such as Gouraud shading or Phong shading. [0003] A common approach to shading is to first decompose a concave polygon into a series of triangles, and then render each triangle incrementally. So far, there is no way to triangulate a concave polygon in linear time complexity, so this process is very time-consuming. [0004] Another common shader method is to fill concave polygons in scanline order. Specifically, a parity test is first used to determine whether a pixel...

AI Technical Summary

Problems solved by technology

However, this method is expensive in accessing memory to determine whether a pixel is inside a concave polygon, and is only suitable for monochrome shading

Images