Polygon Statistics and Polygon Scan-Conversion and Antialiasing

نویسندگان

  • Jim X. Chen
  • Xusheng Wang
چکیده

We present a new method for line drawing, triangle filling, polygon filling, and antialiasing. Current statistics show that our method improves line drawing and antialiasing about 6 times and polygon filling functions significantly over all existing methods. Specifically, it can improve finding the span extrema of polygons about 2 times and drawing the antialiased polygon edges more than 2 times faster than existing methods. The exact overall efficiency of polygon filling and antialiasing is a complex combination of many other factors, which we are unable to provide exact improvement statistics without hardware implementation and test. The idea of our method is completely different from current existing graphics primitive scanconversion (i.e., line drawing, triangle filling, quad filling, and polygon filling in general) algorithms. It is a great extension to our earlier work on line drawing [3, 5]. We save pixel patterns and distances of pixels to lines and edges in a table called SlopeTable. Based on this table, we provide the algorithms to improve the primitive scan-conversions and antialiasing. Improving the efficiency of graphics primitives will significantly advance the whole graphics research and application area.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Polygon Scan Conversion on RMESH Multiprocessors

Polygon scan conversion is an important operation in computer graphics application. Speeding up this operation makes the animation more realistic. In this paper, we present a parallel algorithm to scan convert a polygon from its object space representation into its image space representation using RMESH multiprocessors. The total number of SIMD RMESH processors is N N × , where each processor e...

متن کامل

Developments in High Performance CGI Systems

The work to be described uses a model based on a polygon representation and uses a Geometry Processor sub-system, with a flexible architecture known as MAGIC. This system performs the transformation of the polygon from the 3-D representation to the 2-D perspective projection to the viewing screen co-ordinates and also provides a clipping operation optional in 3-D or 2-D. Two different types of ...

متن کامل

Approximate Line Scan-Conversion and its Hardware Design

This paper presents an approximate multiple segment line scan-conversion method — the Slope Table Method, and analyze the statistics on different properties, advantages, and drawbacks. The statistics show that the new method can increase the percentage of multiple segment lines (i.e., lines with more than one segments) of all possible lines in an N×N raster area from about 39% to more than 99%....

متن کامل

Fast Floating Point Line Scan-Conversion and Antialiasing

We present a new method for scan-converting a straight line with antialiasing. A scan-converted straight line may contain many pixel segments of identical shapes. Therefore, instead of scanconverting the whole line step by step, we can scan-convert multiple segments of a line through copying and replicating. We discovered that through shifting and copying we can quickly achieve antialiasing. Wi...

متن کامل

Algorithm for finding the largest inscribed rectangle in polygon

In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003