Z-BUFFER QUANTIZATION OF THREE-DIMENSIONAL LINES

    公开(公告)号:CA2043176A1

    公开(公告)日:1991-12-30

    申请号:CA2043176

    申请日:1991-05-24

    Applicant: IBM

    Abstract: A method and apparatus is provided which allows a computer graphics system to accurately determine the actual depth value for pixels on a display screen which lie at the same depth as an associated surface. The associated surface is identified such that the delta z value with respect to the x and y direction along the surface can be calculated. The present invention then determines whether the line being considered is contained within a surface, or is an edge lying between, and adjacent to two surfaces. If the line is contained within a surface, the delta z value is initially added to the known endpoints of the line and then successively added, in the incremental x or y directions, to the pixels selected to represent the line. If the line is an edge, and includes selected pixels which lie on both associated surfaces, a filter is invoked that prevents those pixels corresponding to the surface, other than the surface first being considered, from being processed. The pixels being considered are then drawn in the same manner as a line within a surface. In this manner, the actual z value for each selected pixel can be determined and any hidden line, hidden surface removal problems are eliminated.

    12.
    发明专利
    未知

    公开(公告)号:DE10050684B4

    公开(公告)日:2005-12-01

    申请号:DE10050684

    申请日:2000-10-13

    Applicant: IBM

    Abstract: A method and system for profiling a program using periodic trace sampling is provided. During the execution of the program, sample-based profiling of the executing program is performed-for a predetermined period, a profiler performs trace processing for the program, after which the profiler pauses and does not perform trace processing for a predetermined period. The periods controlling the profiler may be selected by a user, and the periods may be measured by temporal or non-temporal metrics. The profiler cycles through these periods, during which selected events are processed to generate a profile of the execution flows within the program. For each sample period, a tree data structure is generated in which nodes of the tree data structure represent the routines of the program that execute during the sample period, as may be indicated by entry and exit events caused by the execution of the routines. When the execution of the program is complete, the tree data structures from each sample period are merged into a resulting tree data structure.

    FAST Z BUFFER INITIALIZE AND UPDATE METHOD

    公开(公告)号:CA2055057A1

    公开(公告)日:1992-06-07

    申请号:CA2055057

    申请日:1991-11-06

    Applicant: IBM

    Abstract: AT9-90-029 FAST Z BUFFER INITIALIZE AND UPDATE METHOD A method is provided for initializing and updating a group of pixels contained on a display in blocks. A group of pixels is considered as a block and has a status word associated therewith. This status word maintains a running total of the maximum z value of any pixel contained within a group, or block of pixels. In this manner, once a block of pixels is rendered on to the display screen a comparison can be made between the current pixels being displayed and a group of pixels which are to be displayed. The minimum z value of the group of pixels to be displayed is compared with the maximum z value for the group of pixels currently being displayed. If the current maximum z value, as stored in the status word, is less than the minimum z value for the pixels to be displayed, then the group of pixels currently being displayed will all "win" when compared to the pixels in the group to be displayed. Thus, a full block bypass of the group of pixels to be displayed is implemented, thereby saving considerable time and overhead when compared to conventional z buffer systems that compare z values for each individual pixel.

Patent Agency Ranking