Abstract: A method for creating a compound file where additional data is inserted into an image file and a data storage device having the compound file recorded therein is provided. The method includes receiving, by a compound file creating apparatus, the image file and the additional data, and creating, by the compound file creating apparatus, the compound file by using the received image file and the additional data, wherein the compound file comprises an image file header corresponding to the image file, image data corresponding to the image file, and a marker recorded in a tail of the compound file and indicating that the compound file is an image file having the additional data inserted therein.

Abstract: A method for creating a compound file where additional data is inserted into an image file and a data storage device having the compound file recorded therein is provided. The method includes receiving, by a compound file creating apparatus, the image file and the additional data, and creating, by the compound file creating apparatus, the compound file by using the received image file and the additional data, wherein the compound file comprises an image file header corresponding to the image file, image data corresponding to the image file, and a marker recorded in a tail of the compound file and indicating that the compound file is an image file having the additional data inserted therein.

Abstract: A triangle traversing method includes a primary traversing and a secondary traversing wherein the primary and secondary traversings are orthogonally related to each other. In the primary traversing, a primary proceeding is performed for producing a reference point and if the primary proceeding passes over an edge of the triangle, a shifting is made to the outermost point related to the previous reference point and then the primary proceeding is again performed. In the secondary traversing, outward proceedings from the reference point produced in the primary traversing are repeatedly performed until all corresponding line points within the triangle are traversed. The primary and secondary traversings are repeatedly and alternately performed, until all the points within the triangle are traversed.

Abstract: An anti-aliasing method greatly reduces the required size of the look-up table (LUT) memory space. The LUT memory is divided into four partitions and the four partitions are partitioned in parallel. This method allows for a great reduction in the amount of memory which needs to be incorporated into an application-specific integrated circuit (ASIC) which results in lower costs.

Abstract: In a computer graphics system, a method for generating a subpixel mask for polygon edges directly by an operation without using a look-up table, includes the steps of forming subblocks by dividing a pixel into n subpixels depending on the slope of the polygon edge, calculating subblock coverage which is a distance from the pixel boundary to the intersection point of n subblocks and polygon edge, and generating an n.times.n subpixel mask depending on the calculated subblock coverage. In an apparatus using the method, edge-generated aliasing is removed.