TW318923B - - Google Patents

Download PDF

Info

Publication number
TW318923B
TW318923B TW85114371A TW85114371A TW318923B TW 318923 B TW318923 B TW 318923B TW 85114371 A TW85114371 A TW 85114371A TW 85114371 A TW85114371 A TW 85114371A TW 318923 B TW318923 B TW 318923B
Authority
TW
Taiwan
Prior art keywords
pixel
edge
color
data
corner
Prior art date
Application number
TW85114371A
Other languages
Chinese (zh)
Original Assignee
Lockheed Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US08/292,209 external-priority patent/US5668940A/en
Application filed by Lockheed Corp filed Critical Lockheed Corp
Application granted granted Critical
Publication of TW318923B publication Critical patent/TW318923B/zh

Links

Landscapes

  • Image Generation (AREA)
  • Controls And Circuits For Display Device (AREA)

Description

318923 五、發明説明(1 發明範圉 本發明與電腦影像產生(CIG)系統有關,特別是,對在 ⑽P時;5V像系統中那些物件的二維表示法顯示,在顯示處理 „„中用的特別的色彩決定裝置及處理描述物件表面影像資 料的特別方法。 ’ 發明背景 a:t ^ ^影像系統是設計來提供各種模擬系統,如坦克 杈擬备及飛仃模擬器逼眞的影像再生。這樣的模擬器被當 成圳涑κ備好讓戰士不用外出到戰場上並使用眞實戰鬥系 統就可㈣練習m讓使㈣,如輯員或坦克砲子 ,維持並提高其技巧而沒有眞實訓練有關的成本。因此提 仪使用者對圳練與練習目的有利的視頻顯示寫實主義是养 常有幫助的。 p在典型的即時電腦影像產生系統中,如飛行模擬系統, 經 部 中 央 標 準 局 員 工 消 费 合 作 社 印 製 〜ί產生可分解成三個分離的處理階段:控制器,幾何處 理态,及顯7F處理器。這三個處理階段或段落每一個各自 獨立地處理代表或相關於要顯示的三個連續的場景之一的 資料。控制器在固定時間中處理,可以是16 67毫秒的畫 :時間或笔秒的框架時間之一,通常是前者,場景或 影像資料’然後將它處理過的資料傳給幾何處理器。此特 疋:畫面與框架時間相當於典型的電視形式顯示時間,也 就是,每秒三十框架每框架兩個交錯掃描畫面。幾何處理 器有相等時間做計算且在該時間ό勺終點其結果被送到顯示 處理器。顯示處理器在一畫面時間中總是處理視頻顯示的 -4-318923 V. Description of the invention (1 invention scope) The present invention is related to the computer image generation (CIG) system, in particular, for the display of those objects in the 5V image system at ⑽P; it is used in the display process The special color determination device and the special method for processing the image data describing the surface of the object. 'Background of the invention a: t ^ ^ The image system is designed to provide various simulation systems, such as the preparation of tank forks and the image reproduction of the flying simulator. This kind of simulator is used as a simulator to prepare soldiers without having to go out on the battlefield and use the actual combat system to practice exercises, such as crew members or tank guns, to maintain and improve their skills without practical training. Relevant costs. Therefore, the video display realism that the users of the instrument will benefit from the training and practice purposes is often helpful. P In a typical real-time computer image generation system, such as a flight simulation system, employees of the Central Standards Bureau of the Ministry of Economic Affairs Printed by the consumer cooperative ~ The production can be decomposed into three separate processing stages: controller, geometry processing state, and display 7F processor. This Each of the three processing stages or paragraphs independently processes data representing or related to one of the three consecutive scenes to be displayed. The controller processes in a fixed time, which can be a picture of 16 67 milliseconds: time or pen seconds One of the frame time, usually the former, the scene or image data, and then pass the processed data to the geometry processor. This feature: the screen and frame time is equivalent to the typical TV format display time, that is, three per second Ten frames with two interlaced scan frames per frame. The geometry processor has equal time to do calculations and the result is sent to the display processor at the end of the time. The display processor always processes the video display in one frame time -4 -

A7 A7 經濟部中央標準局貝工消費合作社印装 五、發明説明(2 ) —個交錯掃描畫面。在每個時間段落中,所有三個處理器 都持續工作,因此,在任何時間t,處理器都處理三個個 別場景。在一時間段落中每個階段處理輸入並產生輸出, 因此資料以順序方式通過此三個階段。計算的負載分散到 刀工的處理奋階段中’如此讓每個畫面或框架時間都顯示 新場景,即使其結果延遲了三個畫面或框架。 、 .例如,在飛行模擬系統中,飛行員的輸入由控制器接收 ,在依序由控制器,幾何處理器及顯示處理器處理後,其 彩色場景輸出被送到飛行員在模擬器中所看到的視頻顯示 器1行員所見資料以應用到環境定義的簡單控制輸入開 始並轉化成像素視頻顯示資訊。在控制器中,飛行員的輸 入用來計算航空器的新位置與方向’由此,計算用來由參 考座標系統到顯示座標系統旋轉物件的數學旋轉矩陣。牽 涉飛行器,目標位置及其他飛行器的任何其他資訊也在控 制器中計算。在某些應用中,控制器是—般用途電腦。 幾何處理器由資料庫讀取在所儲存的三維數位表示法中 可能看見的場景的物件描述。所讀取的物件用控制器中所 計算的旋轉矩陣旋轉到顯示座標當中。這些三維物件的邊 緣若超出視窗邊界則由幾何處理器裁剪。幾何處理器將此 三維資料映射到二維顯示窗。超出顯示窗界限的物件表面 在二維影像空間中被裁剪。另.外,幾何處理器計算(用深 度緩衝器或類似的)哪個物件在其他哪個物件之前或之後 並將此資訊儲存在優先順序表列中。所處理的每個物件由 個別的表面组成’纟中每個表面都是直線邊緣所界定的多 ----------¾衣------iT (請先53-讀背面t注意事項再填寫本頁) -5- 318923 A7 B7 經濟部中央樣準局負工消費合作社印製 五、發明説明(3 邊形的形式3優先順序砉列6人、 I 口%景中所有表面的順序, 以表列中帛冑表面备最尚優先順序表面,而以表列中最 後了個表面#最低優先順序表面。當兩個表面在顯示器上 重登,< 问優先順序表面將可看見’而較低優先順序表面 會被遮蔽。最後,幾何處理料算界定:維表㈣邊緣的 顯示端點,而且也計苴姑;+「、二m ^何迷这些界限邊緣的線性方程式的 係數。 顯不必理為接收—維表面描述,以及表面顏色,表面衰 減資訊,《面優先順序表列,基本單位構造,詳細程度的 混和’透明度’斜曲陰影等,並使用此資訊來輸出場景中 每個像素的資料描述削彡色顯示器。在此找中的每個彩 色顯示器通常由1024條視顏資訊組成,每一條線有⑻“固 色點或像素。但是’其他數目的線條與每線條像素數的組 合當,也可能。顯示處理器必須對每個像素解析它該是什 麼顏巴,&可能出現在—像素上的許多表面,及表面的某 些部份可能被其他表面所覆蓋。由於在顯示器上可以有 1024乘1024個像素,且所有這些像素必須在1/6〇秒中計算 ,因此在顯不處理器中的處理負載是非常高的。要計算多 顯不备系統(單一系統最多包含丨4個顯示器)的視頻,顯示 處理器每秒必須執行超過百億個計算。由於巨大的處理負 載’一個顯不處理器只能驅動幾個顯示器。在某些系統中 ,單一控制器與幾何處理器可用來驅動數個顯示處理器而 每個顯示處理器連接了數個顯示器。因此顯示處理器代表 了在即時電腦影像產生系統中的大多數處理,也因此提高 (請先閱讀背面之注意事項再填寫本頁) •装· 訂A7 A7 Printed by the Beigong Consumer Cooperative of the Central Bureau of Standards of the Ministry of Economy V. Description of the invention (2) — An interlaced scan screen. In each time segment, all three processors continue to work, therefore, at any time t, the processor processes three separate scenarios. Each stage processes input and produces output in a time period, so data passes through these three stages in a sequential manner. The computational load is distributed into the knife-worker's processing stage. This allows each screen or frame time to display the new scene even if the result is delayed by three screens or frames. For example, in a flight simulation system, the pilot ’s input is received by the controller, and after being processed by the controller, geometry processor, and display processor in sequence, the color scene output is sent to the pilot to see in the simulator. The information seen by the staff of the video display 1 starts with a simple control input applied to the environment definition and is converted into pixel video display information. In the controller, the pilot's input is used to calculate the new position and direction of the aircraft ', thereby calculating the mathematical rotation matrix used to rotate objects from the reference coordinate system to the display coordinate system. Any other information related to the aircraft, target position and other aircraft is also calculated in the controller. In some applications, the controller is a general purpose computer. The geometry processor reads from the database object descriptions of scenes that may be seen in the stored three-dimensional digital representation. The read object is rotated into the display coordinates using the rotation matrix calculated in the controller. If the edges of these 3D objects exceed the window boundaries, they are clipped by the geometry processor. The geometry processor maps this 3D data to the 2D display window. The surface of the object beyond the limit of the display window is cropped in the two-dimensional image space. In addition, the geometry processor calculates (using a depth buffer or similar) which object is before or after which other object and stores this information in the priority list. Each object processed is composed of individual surfaces. Each surface is defined by a straight edge ------------ iT (please 53-read first Note on the back t fill in this page) -5- 318923 A7 B7 Printed by the Central Prototype Bureau of the Ministry of Economic Affairs, Consumer Labor Cooperatives V. Invention description (3 polygonal forms 3 priority order 6 people, I mouth% Jingzhong For the order of all surfaces, the surface in the table lists the most preferred surface in order, and the last surface in the table lists #lowest priority surface. When two surfaces reappear on the display, < ask priority surface It will be visible 'and the lower priority surface will be obscured. Finally, the geometric processing is calculated to define: the display endpoint of the edge of the dimension table (iv), and also calculate the Jugu; + ", two m ^ He Mi linearity of these boundary edges The coefficients of the equation. Obviously, it should not be regarded as a receiving-dimensional surface description, as well as surface color, surface attenuation information, "surface priority order list, basic unit structure, detailed level of blending" transparency "diagonal shadow, etc., and use this information to Data description of each pixel in the output scene Cut color display. Each color display in this search usually consists of 1024 visual information, each line has ⑻ "fixed color points or pixels. But the combination of other numbers of lines and pixels per line, It is also possible. The display processor must resolve for each pixel what it should be, & may appear on many surfaces on the pixel, and some parts of the surface may be covered by other surfaces. Because it can be on the display There are 1024 by 1024 pixels, and all these pixels must be calculated in 1 / 6〇 seconds, so the processing load in the display processor is very high. To calculate the multi display system (a single system contains at most 丨 4 Video), the display processor must perform more than 10 billion calculations per second. Due to the huge processing load, a display processor can only drive a few displays. In some systems, a single controller and geometry processor It can be used to drive several display processors and each display processor is connected to several displays. Therefore, the display processor represents the real-time computer image generation system. Most treatment, thus improving (Please read the notes and then fill in the back of this page) • installed · Order

318923 五、發明説明(4) CIG系統此力與寫實的努 ,;术肀在顯不處理器範圍。 在抗渾淆万法中處理像素 亡交哞方呤後本。表震&衫強度貝訊-直是個問題, 匕像素王現所要的元件本身當中防止不合 視頻資料元件(”失眞")及屮 ϋ而 ’ ” 出見4誤顏色,或透明程度時可 看到適當的高解析度邊緣效應。 發明摘要 根據本發明’在即時電腦影像產生器中的顯示處理器包 括:邊緣遮斷計算裝置,接收描述所要顯示的每個多邊形 的至少三個頂點的毐—伽μ % _ , 。 1母個的顯不空間(I,j)座標的輸入資 料訊號,以決定顯示器光柵的每個順序像素的哪一個邊緣 ,如果有的話,會被多邊形邊緣切割,及在所決定的邊緣 上的切割2置;形成每個像素的所有多邊形的邊緣交叉資 料訊號以每一個像素的基準儲存在框架緩衝器中,還有佔 有該像素任何部份的每個表面的色彩資料也儲存在一起: 以及後處理裝置,接收描述與每個要顯示的像素相鄰的四 個像素的1 2個邊緣的座標的資料訊號,以解析邊緣關係並 混合多邊形色彩強度資料來決定接收CIG的視頻資料輸出 的顯示裝置所顯示的每個像素的最後可見顏色。 經濟'邓中央標隼局員工消費合作社印裝 ---------,裝------tT - . (請先閱讀背面之注意事項再填寫本頁) 決足接收即時電腦影像產生器的視頻資料輸出的顯示装 置所顯示的每個像素的最後可見顏色的方法,包含的步驟 有:'首先接收描述所要顯示的每面的至少三個 頂點的每一個的顯示空間(I,J)座標的輸入資料訊號:然 後利用此頂點資料來決定哪一個多邊形邊緣,如果有的話 ,會切割組成顯示光柵的一序列像素中的一個;然後決定 -7- 本紙張尺度適用中國國家橾準(CNS ) A4規格(210X297公釐) 318923 五、發明説明(5 在有關的像♦;喜a l ,、建碌上的切割。形成每個像素的所有多邊形 的邊緣X又資料切咕、— ,. 訊戒以每一個像素的基準儲存在框架緩衝 备T ’還有佔古二、 _ . $孩像素任何部份的每個表面的色彩資料也 儲存在一起:受士 .Α 、有’對每個要顯示的像素,處理選定的相 鄰像素的幾個, (’丨如12)邊緣的排列,以解析邊緣關係並混 &夕邊形色糸 / 3矣度另料來決定每個顯示像素的最後可見顏 色。 ’、 因此本發明的一個目標在提供創新的裝置與方法以決 疋在電腦影像系統顯示器上每個像素的色彩強度。 發月的*這個目標與其他目標在閱讀下面的目前較佳實 施例的詳纟gj iAi· ’伸迷,並參考附隨的相關圖示時會變得清晰易 見。 圖示概述 圖1是可以實施本發明的裝置與方法的電腦影像產生 (CIG)系統的概要方塊圖: 圖2是説明在客觀空間中物件表面多邊形與影像空間中 相對的影像表面多邊形,及將顯現影像表面的顯示器光柵 的圖像元素(像素)間關係的空間性圖示; 經濟部中央標準局員工消費合作社印製 n - I--- ---- - - —I m-----I、ςτ (請先閱讀背面之注意事項再填寫本頁) 圖2 a是圖2在所要顯示的多邊形附近的影像顯示的放大 部份; 圖3 a是顯像一對多邊形表面的顯示像素陣列的概略圖: 圖3 b是定位一多邊形表面的顯示像素陣列的概略圖.,而 且也顯示了根據本發明操作像素色彩資料決定方法所必要 的各種取樣角落C,像素邊緣e與邊緣距離D ; -8 - 冬紙張尺度適用中國國家樣準(CNS)以祕(210x297公董) S箄办^4|^號專利申請案 中^如多正頁(86年6月)318923 V. Description of the invention (4) The CIG system's effort and realism, the technology is not in the scope of the processor. In the anti-aliasing method, deal with the pixels of the fate. Table shock & shirt strength-it is a problem. Among the elements that the Dagger Pixel King currently wants to prevent the inconsistency of video data components ("missing") and 勮 ϋ and "" when 4 colors or transparency is seen Appropriate high-resolution edge effects can be seen. SUMMARY OF THE INVENTION According to the present invention, the display processor in the real-time computer image generator includes: an edge occlusion computing device, which receives a 毐 -Gamma μ% _ describing at least three vertices of each polygon to be displayed. The input data signal of a parent's display space (I, j) coordinates to determine which edge of each sequential pixel of the display raster, if any, will be cut by the polygon edge and on the determined edge The cutting of 2 sets; the edge cross data signals of all the polygons forming each pixel are stored in the frame buffer on the basis of each pixel, and the color data of each surface occupying any part of the pixel is also stored together: And a post-processing device, receiving data signals describing the coordinates of 12 edges of four pixels adjacent to each pixel to be displayed, to analyze the edge relationship and mix polygon color intensity data to determine the output of the video data received by CIG The last visible color of each pixel displayed by the display device. Economy 'Deng Central Standard Falcon Bureau Employee Consumer Cooperative Printed ---------, installed ------ tT-. (Please read the precautions on the back before filling out this page) The method of displaying the last visible color of each pixel displayed by the display device of the video data output of the image generator includes the following steps: 'First receive the display space describing each of the at least three vertices of each face to be displayed (I , J) the input data signal of the coordinate: then use this vertex data to determine which polygon edge, if any, will cut one of the pixels in a sequence that constitute the display raster; then decide -7- This paper scale is applicable to China Standard (CNS) A4 specification (210X297mm) 318923 V. Description of the invention (5 In the relevant image ♦; hi al, the cut on the building. The edges X of all the polygons forming each pixel are also cut, —,. Xunjie is stored in the frame buffer T ’on a per-pixel basis, and the color data of each surface of any part of the $ child pixel is also stored together: JS.Α, Yes 'For each Pixels shown, deal with a few of the selected adjacent pixels, ('丨 such as 12) the arrangement of the edges, to analyze the edge relationship and mix & evening edge shape color / 3 degrees of degree to determine the display pixel Finally, the color is visible. 'Therefore, an object of the present invention is to provide an innovative device and method to determine the color intensity of each pixel on the display of the computer imaging system. The details of the preferred embodiment will be clear and easy to see when referring to the accompanying drawings. Figure overview is a computer image generation (CIG) that can implement the device and method of the present invention. The general block diagram of the system: FIG. 2 is a spatial diagram illustrating the relationship between the object surface polygon in the objective space and the opposite image surface polygon in the image space, and the image elements (pixels) of the display raster that will display the image surface; Printed by the Employee Consumer Cooperative of the Central Bureau of Standards of the Ministry of Economic Affairs n-I --- -------I m ----- I, ςτ (please read the precautions on the back before filling in this page) Figure 2 a is Figure 2 is shown The enlarged part of the image display near the polygon; Figure 3a is a schematic diagram of a display pixel array developing a pair of polygonal surfaces: Figure 3b is a schematic diagram of a display pixel array positioning a polygonal surface, and also shows Various sampling corners C, pixel edges e and edge distances D necessary for operating the pixel color data determination method according to the present invention; -8-The winter paper scale is applicable to the Chinese National Standards (CNS) to the secret (210x297 public director) S 箄 办 ^ 4 | ^ In the patent application ^ such as the main page (June 86)

發明説明( 0 經濟部中央標準局貝工消費合作社印*- 3 C疋像素角落c 0與其相鄰角落排列,邊緣交叉與距 離的表^示法,而且對認識本發明的數個方向很有用/、 圖4疋根據本發明的原理使用在cig顯示處理器的色彩 強度次組合的方塊圖; 、’ 5b ’ 5d與5e分別是用在操作色彩強度次組合的 方法中的邊緣決疋’邊緣段長度決^,小多邊形過滤及色 彩混合處理部份的流程圖; 圖51)’顯不有關每個被操作像素的8_像素,12•邊緣段排 列而且對瞭解方法的運作很有用; 圖5b"顯示在本方法中線條長度決定的一個方向; 圖5 c顯示在3 * 3像素星狀排列中混合色彩的實施; 圖6a顯示其餘組對不同透明程度與不同樣式選擇位元的 一進位値取樣的角落,而圖6b_6g顯示各種不同透明度操 作與條件,且都對瞭解達成透明的"透梘,,方法很有用; 圖7是根據本發明的色彩強度次組合一種可能的創新後 處理器邊緣暫存器/解析器裝置施行的概要方塊圖;及 圖8a-8g顯示所有有一對邊緣被單—多邊形邊緣切割的可 能的像素集合,及一個像素的所有四個邊緣被在該像素上重 叠的四個多邊形間所形成的邊緣所切割的單一的可能情況。 範例實施例詳沭 一開始參考圖1,顯示了電腦影像產生系統1 0,如飛行 器駕驶艙模擬系統,的功能性方塊圖。現有的CIG技藝, 包括如1988 ’ 2月2 3,發給Bunker等人的U. S.專利編號 4,727,365的”先進的視頻物件產生器,,及i989,4月25,發 -9- 本紙张尺度適用中國國家樣準(CNS > A4規格(210X297公瘦) n^i I^-- (請先閱讀背面之注意事項再填寫本頁) 訂 318923 五、發明説明( ,D.MerZ的U.S.專利編號4,825,391的"對即 產生系統的深度緩衝器優先順序處理..等出版物,::: 整合併在此以供閲讀者參考。 郁被元 一此系統包括了控制器單元12,幾何處理器單元 不處理器單元16。顯示處理器單元16顯示資訊定及顯 模Γ飛行器在場景上的動作3新兵 处過輸入控制介面2 2連接到電腦影像產生系统^ 〇 員在駕駛艙中的演習動作被饋入到輸入控制介面:塊行 控制介面將相關飛行資料如飛行器位置哭了 :輸入 簸’及偏航姿勢等由飛行員轉換到控制器丨2。翊,顚 經濟部令央標準局員工消费合作社印製 ' ‘种衣— - ; (請先閱讀背面之注意事項再填寫本頁) 在控制器12中,飛行員輸入被用來計算飛行器的新 與方向’並由此,計算在此技藝中所熟知用來由參考:二 系統到顯示座標系統旋轉物件的數學旋轉矩陣。奪步尸寻 ,目標或其他飛行器位置的其他資訊在控制器中計^在 某些電腦影像產生Μ巾’控制器單元是—般料電腦。 —控制器單元12由最新飛行器定向定期地更新。此定向由 飛行員透過輸人控制介面22達到控制器12包括㈣器的 翻轉,顚簸’及偏航,及位置等。控制器12在一畫面或框 架時間中處理場景然後傳遞資料到幾何處理器Μ。 幾何處理器1 4由場景資料庫記憶體2 4讀取在所错存的地 面的三維數位表示法中可能看見的物件描述如塔,路,河 三棚廠等。物件由場景資料庫讀出並使用在控制器丨2所計 #的旋轉矩陣轉入到顯示座標中。幾何處理器14裁剪在客 觀二間中超出視窗邊界的所有邊緣。它將三維物件資料數 10 本纸張尺度顧丨ox29^ 五、發明説明(8 ) A7 B7 經濟部中央標準局員工消费合作社印製 學映射到二維顯視窗。超出視窗邊界的物件表面在二維影 像工間中裁剪。_維物件包含點,線,閉合的凸多邊形, 或其組合。每個閉合的凸多邊形即爲表面。因&,所處理 的每個物件由個別的表面組成,其中每個表面由直線邊缘 所界足。一旦在幾何處理器14中由三維物件計算出表面, 此資料被傳遞到顯示處理器i 6。另外,幾何處理器^ 4用 已知的方法計算哪個表面在其他哪個表面之前或之後並將 此資訊儲存在優先順序表列。優先順序表列包含場景中所 有表面的順序,以表列中第—個表面當最高優先順序表面 ’而以表列中最後-個表面當最低優先㈣表面。當兩個 表面在顯示器上重疊,較高優先順序表面將才看見,而較 低優先順序表面的重疊部份會被遮蔽。在計算優先順序表 列之後,幾何處理器14計算界定二維表面的線段的顯示端 點並计算描述這些界限邊緣的線性方程式的係數。幾何處 理1 4计算岛述所界定表面的每個邊緣的端點與斜度。然 後這些資科被傳遞到顯示處理器1 6。 在圖1中,顯示了用來驅動視頻顯示器18的顯示處理器 1 6。在某些系統中,單一的控制器丨2及幾何處理器1 *驅 動一個以上的顯示處理器。顯示處理器16代表了在即時電 腦影像產生系統中的大多數處理與硬體,因此,降低硬體 與處理時間大小的努力大部分集中在顯示處理器範園。顯 不處理器負責處理顯示到視頻顯示器1 8上的資訊。顯示處 理器丨6必須對視頻顯示器1 8上的每個像素解析它該是什 麼顏色,給可能出現在一像素上的許多表面,及表面上那 -11 本紙择·尺度適用中國國家楼準(CNS ) a4規格(210X297公釐) ---------A — - . (請先閲讀背面之注意事項再填寫本f) 訂 * n I · I f — . 318923 A7 ~ - __B7 五、發明説明(9) 些可能被其他表面所覆蓋的部份。在解決了像素中優先順 序的矛盾之後,在像素中每個可見表面的區域被乘以其表 面的色彩’而所有這些加權色彩的總合被當成像素色彩輸 出。顯示處理器1 6由幾何處理器1 4接收二維表面描述, =及表面顏色,表面優先順序表列,並使用此資訊來輸出 場景到彩色視顏顯示器丨8。在系統中的每個彩色顯示器可 由1024或更夕條視頻&訊組成,每一條線通常有1 ο〕#個色 點或像素(圖像元素)。由於在顯示器上可能有多於百萬個 像素’且所有這些像素必須在1/6〇秒中計算,因此在顯示 處理器中的處理負載是非常高的。顯示莽對每個像素可能 接收到1 2個位元的的紅色資料訊號,1 2個位元的緣色資 料訊號’及1 2個位元的藍色資料訊號當色彩強度資訊的一 部份來描述像素顏色。 經濟部中央標隼局員工消费合作社印製 (請先閎讀背面之注意事項再填寫本頁) 參考圖2,觀察者的眼睛20,在觀看點Vp正看著视窗上客 觀空間30’中的多邊形取樣表面3 0。只有沿著視線3 2最接 近觀看者20'的表面3 〇會被看見;所可見到的表面藉由使 用習於此藝者所熟知的深度緩衝器技術來比較觀看點v p 與表面的點P f間的射程距離r來決定。因此,可見的多邊 形3 0(在此,是由三角形的頂點Va,Vb與Vc所識別的表 面)便是沿著視線3 2有最小射程Rm丨n的多邊形。客觀空間 30'被投射到影像空間3 4,中的顏視窗3 4上;多邊形表面 3 〇被投射成顯示多邊形3 6,個別的頂點Va,Vb,與Vc 分別對應到頂點V i,V 2與V 3。顯示窗常常是顯示器的光 柵’其每個像素3 8依順序方式沿著水平線(在J方向)由光 -12- 本紙張尺度適用中國國家裙準(CNS > A4規格(210X297公釐) Ο丄 8923 Α7 Β7 五、發明説明(1〇) 柵/視窗的左邊緣(J=J。)到右邊緣㈣max)掃描,及對由光 拇/視窗的了黃邊緣㈣0處)到底邊緣㈣㈣)往下距離遞增( 在1方向)的線條掃描。因此,第P條線Lp由第一個(左手邊) 像素Pi到最後-個(右手邊)像素Pr掃描3像素pp由穿過 視窗平面34的視線32來確認,因此像素pp包括了影像點 ,及相對映射到多邊形的點Pf3多邊形36將包括沿著直 線Lp與左邊直線交叉位置Jl的最左邊像素p〇到與右邊直 線父叉位置JR的最右邊像素Pq的所有像素。 放大所考慮的影像空間的部份,如圖2a,沿著掃描線 34”的像素列38在j方向依序掃描,由最在邊像素3訃開始 •’然後操作下一個像素38i ’及其後的像素直到達到該掃 描線上在多邊形的左邊緣上且被多邊形3 6部份遮蓋的像素 381。此像素被當成多邊形邊緣與;直線34"最左邊交叉位 置JL。沿此直線繼續,經過其他被多邊形完全覆蓋的像素 j 8,達到該掃描線上在多邊形的右邊緣上且被多邊形3 6 邵份返蓋的像素38r :此像素被當成與多邊形邊緣的最右 邊父叉位置JR。繼纈沿著j線條34"前進最後達到該掃描線 的最右邊像素38v。在不考慮更遠的多邊形的透明度與色 度時’完全被多邊形36所覆蓋,也就是完全在其中,的像 素3 8的屬性正是多邊形表面的屬性(顏色,色彩強度,透 明度等),而當像素(例如像素3 8丨及3 8r )被多邊形3 6部份 遮蓋時該等特定多邊形的屬性只代表了像素被其眞正遮蓋 的部份’因此該像素其餘部份的屬性必須由其他資訊取得 並根據该像素被每個多邊形/色彩資訊來源所遮蓋的各種 -13- 本紙張尺度適用中國國家榡準(CNS ) A4規格(2丨Οχ297公釐) 一锖先®讀背面之注意事項再填寫本頁) 經濟部中央裙準局負工消費合作杜印製Description of the invention (0 Printed by Beigong Consumer Cooperatives, Central Bureau of Standards, Ministry of Economic Affairs *-3 C, pixel corners c 0 and its adjacent corners, the expression of edge intersection and distance, and it is useful for understanding several directions of the invention /, FIG. 4 is a block diagram of the color intensity sub-combination used in the cig display processor according to the principles of the present invention; 5 ′ and 5e are the edge resolutions used in the method of operating the color intensity sub-combination respectively Segment length decision, small polygon filtering and color mixing processing part of the flow chart; Figure 51) 'Display 8_ pixels for each pixel manipulated, 12 • edge segment arrangement and useful for understanding the operation of the method; Figure 5b " shows a direction determined by the length of the line in this method; Figure 5c shows the implementation of mixing colors in a 3 * 3 pixel star arrangement; Figure 6a shows the rest of the group ’s selection of bits for different levels of transparency and different styles The corners of sampling, and Figures 6b-6g show various different transparency operations and conditions, and they are all useful for understanding the "transparent" method of achieving transparency; Figure 7 is based on the strong color of the present invention A summary block diagram of the implementation of a possible innovative post-processor edge register / parser device; and Figures 8a-8g show all possible pixel sets with a pair of edges cut by a single-polygon edge, and all four of a pixel A single possible situation where an edge is cut by an edge formed between four polygons overlapping on the pixel. Detailed description of the exemplary embodiment Referring to FIG. 1 initially, a functional block diagram of a computer image generation system 10, such as an aircraft cockpit simulation system, is shown. Existing CIG skills, including the "Advanced Video Object Generator" of US Patent No. 4,727,365 issued to Bunker et al., February 23, 1988, and i989, April 25, issued -9-This paper size is applicable to China National standard (CNS > A4 specification (210X297 male thin) n ^ i I ^-(please read the precautions on the back before filling in this page) Order 318923 V. Description of invention (, D.MerZ US Patent No. 4,825,391 The "Quote Processing of Depth Buffer Priority of the Immediate Generation System .. and other publications, :: Integrated and here for readers' reference. Yu Youyuan This system includes a controller unit 12, a geometry processor unit Not the processor unit 16. The display processor unit 16 displays information to determine and display the movement of the aircraft on the scene. 3 The recruit enters the input control interface. 2 2 Connects to the computer image generation system. Feed to the input control interface: the block line control interface cries related flight data such as aircraft position: input jitter and yaw posture are transferred from the pilot to the controller 丨 2. Yi, the Ministry of Economy ordered Central Standards Bureau employees to eliminate Printed by Fei Cooperative '' seed coat —-(please read the notes on the back before filling in this page) In the controller 12, the pilot input is used to calculate the new and direction of the aircraft ' It is well-known in the mathematical rotation matrix used by the reference: two systems to display the rotating objects of the coordinate system. Snatching corpses, other information about the position of the target or other aircraft are calculated in the controller ^ generated in certain computer images. The controller unit is a general computer.-The controller unit 12 is regularly updated with the latest aircraft orientation. This orientation is reached by the pilot through the input control interface 22 to reach the controller 12 including the rollover, bumping and yaw of the aircraft, and position Etc. The controller 12 processes the scene in a frame or frame time and then transfers the data to the geometry processor M. The geometry processor 14 reads from the scene database memory 24 in the three-dimensional digital representation of the stray ground The description of the objects that may be seen such as towers, roads, Hesanpeng Factory, etc. The objects are read out from the scene database and transferred to the display coordinates using the rotation matrix of ## calculated in the controller 丨 2. The geometric processor 14 cuts all the edges beyond the window boundary in the objective two rooms. It counts the three-dimensional object data in 10 paper scales. Guxi ox29 ^ V. Invention description (8) A7 B7 Printed by the Employee Consumer Cooperative of the Central Standards Bureau of the Ministry of Economy The system is mapped to the two-dimensional display window. The surface of the object beyond the boundary of the window is cropped in the two-dimensional image workshop. The dimensional object contains points, lines, closed convex polygons, or a combination thereof. Each closed convex polygon is the surface Because of &, each object processed consists of individual surfaces, where each surface is bounded by a straight edge. Once the surface is calculated from the three-dimensional object in the geometry processor 14, this data is passed to the display processor i 6. In addition, the geometry processor ^ 4 uses known methods to calculate which surface is before or after which surface and stores this information in the priority list. The priority list contains the order of all the surfaces in the scene, with the first surface in the list as the highest priority surface ’and the last surface in the list as the lowest priority surface. When the two surfaces overlap on the display, the higher priority surface will be seen, and the overlapping part of the lower priority surface will be blocked. After calculating the priority list, the geometry processor 14 calculates the display end points of the line segments defining the two-dimensional surface and calculates the coefficients of the linear equations describing these boundary edges. Geometric processing 14 Calculate the endpoint and slope of each edge of the surface defined by the island. These resources are then passed to the display processor 16. In Fig. 1, a display processor 16 for driving the video display 18 is shown. In some systems, a single controller and geometry processor 1 * drive more than one display processor. The display processor 16 represents most of the processing and hardware in the real-time computer image generation system. Therefore, efforts to reduce the size of hardware and processing time are mostly concentrated on the display processor. The display processor is responsible for processing the information displayed on the video display 18. The display processor 丨 6 must analyze what color it should be for each pixel on the video display 18, and give many surfaces that may appear on a pixel, and the -11 paper size on the surface. The scale is suitable for China National Building Standard ( CNS) a4 specification (210X297 mm) --------- A —-. (Please read the notes on the back before filling in this f) Order * n I · I f —. 318923 A7 ~-__B7 5 2. Description of the invention (9) Some parts that may be covered by other surfaces. After resolving the contradiction of priority order in pixels, the area of each visible surface in the pixel is multiplied by the color of its surface 'and the sum of all these weighted colors is output as the pixel color. The display processor 16 receives the two-dimensional surface description from the geometry processor 14 == surface color, surface priority list, and uses this information to output the scene to the color visual display 丨 8. Each color display in the system can be composed of 1024 or more video & signals, and each line usually has 1 color point or pixel (picture element). Since there may be more than one million pixels on the display 'and all these pixels must be calculated in 1 / 6O seconds, the processing load in the display processor is very high. Each pixel may receive 12-bit red data signal, 12-bit margin color data signal 'and 12-bit blue data signal as part of the color intensity information. To describe pixel colors. Printed by the Employee Consumer Cooperative of the Central Standard Falcon Bureau of the Ministry of Economic Affairs (please read the precautions on the back before filling in this page) Referring to Figure 2, the observer's eye 20 is looking at the objective space 30 'on the window at the viewing point Vp Polygon sampling surface 30. Only the surface 30 that is closest to the viewer 20 'along the line of sight 32 will be seen; the visible surface is compared with the point P of the viewing point vp by using the depth buffer technique known to the artist The range distance r between f is determined. Therefore, the visible polygon 30 (in this case, the surface identified by the vertices Va, Vb, and Vc of the triangle) is the polygon with the smallest range Rmn along the line of sight 32. The objective space 30 'is projected onto the image space 34, the middle window 34; the polygonal surface 30 is projected to display the polygon 36, the individual vertices Va, Vb, and Vc correspond to the vertices Vi, V2, respectively. With V 3. The display window is often the raster of the display. Each pixel is light in a sequential manner along the horizontal line (in the J direction). This paper size is applicable to China National Skirt Standard (CNS & A4 specifications (210X297mm). Ο丄 8923 Α7 Β7 V. Description of the invention (10) Scanning from the left edge of the grid / window (J = J.) To the right edge (max), and from the yellow edge of the light / window (at the 0 edge) to the bottom edge (iv) Line scan with increasing distance (in 1 direction). Therefore, the Pth line Lp is scanned from the first (left hand) pixel Pi to the last (right hand) pixel Pr by scanning 3 pixels pp by the line of sight 32 passing through the window plane 34, so the pixel pp includes the image point , And the point Pf3 that is relatively mapped to the polygon. The polygon 36 will include all pixels along the straight line Lp and the leftmost pixel p0 at the position J1 that crosses the left straight line to the rightmost pixel Pq at the parental position JR of the right line. Enlarge the part of the image space under consideration, as shown in Figure 2a, the pixel rows 38 along the scan line 34 "are scanned sequentially in the j direction, starting with the most adjacent pixel 3 o 'then operate the next pixel 38i' and After the pixel reaches the pixel on the scan line that is on the left edge of the polygon and is partially covered by the polygon 36. This pixel is regarded as the edge of the polygon and the line 34 " the leftmost intersection position JL. Continue along this line and pass other The pixel j 8 that is completely covered by the polygon reaches the pixel 38r that is on the right edge of the polygon on the scan line and is covered by the polygon 36 6: this pixel is regarded as the rightmost parent fork position JR with the edge of the polygon. With the j-line 34 " advancing to reach the rightmost pixel 38v of the scan line. Without considering the transparency and chroma of the further polygon, it is completely covered by the polygon 36, which is completely in it, the property of the pixel 3 8 It is the properties of the polygon surface (color, color intensity, transparency, etc.), and when the pixels (such as pixels 3 8 丨 and 3 8r) are partially covered by the polygon 36, these specific many The attribute of the shape only represents the part of the pixel that is covered by the eye. Therefore, the attributes of the rest of the pixel must be obtained from other information and based on the various types of pixels covered by each polygon / color information source. Standards are applicable to China National Standard (CNS) A4 (2 丨 Οχ297mm) Yi Yongxian® Read the notes on the back and then fill out this page) The Central Skirt Bureau of the Ministry of Economic Affairs of the Ministry of Economic Affairs Cooperative Printing

裝 訂------- __ 318923 A7 B7 經濟部中央標準局員工消費合作社印製 五、發明説明(11 百分比加以混合。 這可參照圖3 a來瞭解,其中笛 ,^ ,、甲第一個多邊形36a順序在另 一多邊形3 6 b之前(如由任付τ & 、 1 1T眾所週知的深度緩衝處理), 如影像空間中所見。多邊形36有多個頂點(如四個心W ,V2, V3與V4)由一樣多個多邊形邊緣%如邊緣39a, ,39b,39C與39d)在交又點4〇穿過像素邊界所連接。影 像螢幕以像素的矩形陣列形式,沿著水平邊緣£的水平線( 例如像素線.··’ L-2’ L-〗,L,L+1,l + 2,…)依序排列在 垂直攔位(例如欄位...,p_2,p_ 1,p,p + 1,p + 2,)上的 下一較高編號(要接著掃描)的每條像素線L的較低界線上 。如此每個像素可以由其列L與欄P號碼排順序3將可見 到某些像素,如像素(L,P) ’只被一多邊形(多邊形36&) 完全覆蓋也因此只有該多邊形的屬性:其他像素共用/現 合多個多邊形的屬性。 根據本發明的一個方向’如圖3 b所顯示,我們偏好考慮 整個像素而不必處理每個像素的多個次區域(或次像素)的 色彩資訊來決定其色彩屬性,即便是使用了前述的U · S.專 利编號4,825,39 1的深度緩衝處理架構(不論使用或不使用 翼展/副翼展處理方法)。應該要知道在我們的方法中處理 的每個資訊項目是電子數位資料的訊號字组;而我們可能 用速*己名稱(如角落,邊緣,多邊形等)討論這些訊號,雖 然如此我們仍用這些名詞表示用在每個個別幾何概念的資 料訊號(例如”角落"指描述二維像素角落位置的資料字組 ,”邊緣”是代表相關多邊形邊緣線條的資料訊號组,,,多 -14 木纸張尺度適财賴家標準(CNS)〜祕(2iGX297公釐) I. m 1^1 - -I : ·---1 In )'*^I -I 1---- II - -1 — «^1 Τ» 、τ (請先閱讀背面之注意事項再填寫本頁) A7 B7 五、發明説明(12) 邊形’’指相當於特定多邊形的數位資料結構等)。我們處理 過程的終端結果是提供最後順序的視頻訊號(數位視頻, 或由數位推演出的類比視頻)使視頻顯示裝置i 8上個別像 素的色彩與強度爲觀察者2 0所可見到。 多邊形36在像素區間取樣;在此,取樣點是每個像素的 四個角落C。對每個像素(l,P),可以使用角落的4 χ 4陣 列(例如角落C11到C14在邊緣Ε-2上,角落C21到C24在邊 緣E-1上,角落C3u,〗C34在邊緣[上,角落^丨到^4在邊 緣E+ 1上)來定義像素的3 x 3陣列(然後考慮圍著中央像素 L,P的8個相鄰像素):因此像素陣列包括沿著直線(l」) 的像素(L-1,Ρ·υ,(Lq,P),(L],p+1),沿著直線⑴ 像素(L,P-1) , (L,p),(L,P+1),及沿著直線(L+1)的像 素 α+1,P-1),(L+i,P),(L+1,阳)。落在角落(樣本) 點C ij上(其中i是該相關像素的線條標名而j是攔位標名)最 接近觀看者的多邊形36”的顏色,對顯示器的每個像素加 以儲存。所形成的色彩資料訊號儲存在包含組成顯示器的 每個像素的色彩資訊的視頻記憶體中。 在視頻記憶體中每個角落取樣點C的色彩資訊用熟知 CIG技藝者所熟悉的傳統方法計算。我們只要由每個像素 的一個角落取得色彩資訊(例如在I ’ j顯示中每個像素的 第一個碰到的,或左上的,角落);當對所有相鄰像素的 左上角落C 〇的資料都準備好了,就可以決定任何—個特 定像素的%整色彩資訊。由一個角落的色彩屬性所代表的 每個像素的區域可以透過有關多邊形邊緣交又點4 〇落在角 _ - 15· 本紙張尺度·巾關家縣(CNS ) M驗(21QX297公楚- ~ ' '~~~~~~- I^i I —1 .—裝-- (請先閱讀背面之注意拿,項再填寫本頁)Binding ------- __ 318923 A7 B7 The Ministry of Economic Affairs Central Standards Bureau Employee Consumer Cooperative printed five. The description of the invention (11 percentages are mixed. This can be understood with reference to Figure 3 a, where flute, ^ ,, A first A polygon 36a comes before another polygon 3 6 b (as shown by Ren Fu τ & 1 1T well-known depth buffer processing), as seen in image space. Polygon 36 has multiple vertices (such as four centroids W, V2 , V3 and V4) are connected by the same polygon edge% as edges 39a, 39b, 39C and 39d) through the pixel boundary at the intersection point 40. The image screen is in the form of a rectangular array of pixels, along the horizontal lines of the horizontal edges (for example, pixel lines ... L'L-2 'L-〗, L, L + 1, l + 2, ...) are sequentially arranged in the vertical block The lower boundary of each pixel line L of the next higher number (to be scanned next) on the bit (eg, field ..., p_2, p_1, p, p + 1, p + 2,). In this way, each pixel can be seen in the order of its column L and column P number 3. Some pixels can be seen, such as the pixel (L, P) 'is only completely covered by a polygon (polygon 36 &) and therefore only the attributes of the polygon: Other pixels share / extract multiple polygon attributes. According to one direction of the present invention, as shown in FIG. 3b, we prefer to consider the entire pixel without having to process the color information of multiple sub-regions (or sub-pixels) of each pixel to determine its color attributes, even if the aforementioned U · S. Patent No. 4,825, 39 1 depth buffer processing architecture (whether or not using wingspan / aileron wings processing method). It should be known that each information item processed in our method is a signal word block of electronic digital data; and we may discuss these signals using our own names (such as corners, edges, polygons, etc.), although we still use these The noun refers to the data signal used in each individual geometric concept (for example, "corner" refers to the data word group describing the corner position of the two-dimensional pixel, and "edge" is the data signal group representing the edge line of the relevant polygon. Paper standard suitable financial standard (CNS) ~ secret (2iGX297 mm) I. m 1 ^ 1--I: · --- 1 In) '* ^ I -I 1 ---- II--1 — «^ 1 Τ», τ (please read the precautions on the back before filling in this page) A7 B7 5. Description of the invention (12) "Polygon" refers to the digital data structure equivalent to a specific polygon, etc. Our processing process The end result is to provide the final sequence of video signals (digital video, or analog video deduced by digital) so that the color and intensity of individual pixels on the video display device i 8 are visible to the observer 20. Polygon 36 is sampled in the pixel interval ; Here, the sampling point Are the four corners C of each pixel. For each pixel (1, P), a 4 × 4 array of corners can be used (for example, corners C11 to C14 are on edge E-2, and corners C21 to C24 are on edge E-1 Upper, corner C3u, C34 on the edge [upper corner ^ 丨 to ^ 4 on the edge E + 1) to define a 3 x 3 array of pixels (then consider the 8 adjacent pixels surrounding the central pixel L, P): Therefore, the pixel array includes pixels (L-1, P · υ, (Lq, P), (L], p + 1) along the straight line (1 ″), and pixels (L, P-1) along the straight line (1), (L, p), (L, P + 1), and the pixels α + 1, P-1), (L + i, P), (L + 1, Yang) along the line (L + 1). The color that falls on the corner (sample) point C ij (where i is the line name of the relevant pixel and j is the stop name) closest to the viewer ’s polygon 36 ”is stored for each pixel of the display. The formed color data signal is stored in the video memory containing the color information of each pixel that constitutes the display. The color information of the sampling point C in each corner of the video memory is calculated by the traditional method familiar to those skilled in CIG. We As long as the color information is obtained from one corner of each pixel (for example, the first touch of each pixel in the I'j display, or the upper left corner); when the data for the upper left corner C 〇 of all adjacent pixels When you are ready, you can determine the% full color information of any specific pixel. The area of each pixel represented by the color attribute of a corner can pass through the intersection of the relevant polygon edge and the point 4 〇 falls at the corner_-15 · The size of this paper · Mianguanjia County (CNS) M inspection (21QX297 Gongchu-~ '' ~~~~~~-I ^ i I —1 .—installed-(please read the notes on the back to take, item and then Fill in this page)

*1T 經濟部中央標準局員工消費合作社印製 經濟部中央搮準局負工消費合作社印製 18^3 A7 _ __B7 五、發明説明(13)* 1T Printed by the Employee Consumer Cooperative of the Central Bureau of Standards of the Ministry of Economic Affairs Printed by the Consumer Labor Cooperative of the Central Bureau of Accreditation of the Ministry of Economy 18 ^ 3 A7 _ __B7 V. Description of the invention (13)

落點C 〇預先遠定的線條段排列的知識來決定:在此’我 們使用4線條段排列”穿過"5角落排列(中央角落C 〇及關於 該中央像素角落C 〇的四個角落點)。依角落C 〇的1 2點鐘 位置順時針方向,這四個線段排列是:介於角落C 〇與緊 鄰其上在前一個邊緣(E-2)上的CT間的上線條段ST ;介於 角落C 〇與緊鄰其右在掃描邊緣(E- 1)上的CR間的右線條段 SR :介於角落C 〇與緊鄰其下在下一個邊緣(E)上的CB間的 下線條段SB :及介於角落C 〇與緊鄰其左在相同邊緣(E-1) 上的Cl間的上線條段SL。距離D、,其中X是T,R,B或L ,由像素角落C 〇到相關的交又點4 0的上,右,下,左線 條段,由此技藝中所熟知的處理與方法來決定,而距離Dx 資料訊號儲存在視頻記憶體中。另外,對每個角落取樣點 C 〇的透明度標識位元(可定義爲清晰==〇及不透明=1 )也加 入到視頻記憶體。 現在參考圖3 c,若相同多邊形遮蓋住像素取樣點C 〇, 該多邊形的邊緣被用來決定每個垂直與水平邊緣穿過像素 取樣點與其四個相鄰取樣角落C X排列間的位置40x。如此 ,決定了邊緣交叉位置40t,40r,40b,與401並計算出所 有相對的距離DT,DR,DB與DL且儲存到視頻記憶體。但 是,若邊緣交叉距離Dx大於角落取樣點間的距離,則距離 Dx被約束成取樣點間的距離。相鄰排列角落間的距離可以 設定成正規化的値1 .〇 :然後眞正距離Dx都被正規化成〇 〇 與1 _ 0間的値。如所顯示,由中央角落C 〇向前到中上角落 CT的邊緣交叉位置40t的距離DT,小於1 0 (角落到角落的 -16- 衣紙張尺度適用中國國家標準(CNS ) A4規格(210X297公釐) --------'1裝------訂 (請先閱讀背面之注意事項再填寫本頁} A7 B7 經濟部4-央樣準局男工消費合作杜印製 五、發明説明(14 完整距離)並且將計算出的眞正 e 、 距離错存成資料訊號。分 別在中央角落Co與相對的右邊及左邊交又位置術與4〇1的 距離DR與DL也相同,因爲每個正規化的距離小於角落到 角落的距離《但對在相鄰角落cB底下的交又位置稱就不 是這樣了’也因此有大於-的距離:距離値被約束成10 ,指示多邊形超出角落C(^CB。也就是,若距離0、等於 角落取樣點間的距離,則在中央角落點上的多邊形被 當成也遮蓋了對應的相鄰取樣角落。在资 距離Dx使用的位元數在3到5個位元間,但可子因且=統 而并。因此每個角落取樣點C是視頻記憶體中一分離位置 的位址,該位置包含描述色彩的資料,透明度標識,及相 關上,左,右及下叉叉位置距離資料。若在取樣點上的多 邊形是透明的,也設定透明度標識。The landing point C 〇 is determined by the knowledge of the arrangement of the line segments in advance: here we use 4 line segment arrangements to pass through " 5 corner arrangements (the central corner C 〇 and the four corners about the central pixel corner C 〇 Point). According to the clockwise position of the 12 o'clock position of the corner C 〇, the four line segments are arranged: the upper line segment between the corner C 〇 and the CT on the previous edge (E-2) immediately above it ST; the right line segment SR between the corner C 〇 and the CR immediately to the right on the scanning edge (E-1): between the corner C 〇 and the CB immediately below the next edge (E) Line segment SB: and the upper line segment SL between the corner C 〇 and Cl on the same edge (E-1) immediately to its left. The distance D, where X is T, R, B or L, is determined by the pixel corner C 〇 to the relevant intersection point 40, the upper, right, lower, and left line segments are determined by the processing and methods well known in the art, and the distance Dx data signal is stored in the video memory. In addition, for each The transparency identification bits (which can be defined as clear == 〇 and opaque = 1) of the corner sampling point C 〇 are also added to the video memory Referring now to FIG. 3c, if the same polygon covers the pixel sampling point C, the edge of the polygon is used to determine the position 40x between each vertical and horizontal edge passing through the pixel sampling point and its four adjacent sampling corners CX arrangement. In this way, the edge crossing positions 40t, 40r, 40b, and 401 are determined and all relative distances DT, DR, DB, and DL are calculated and stored in the video memory. However, if the edge crossing distance Dx is greater than the distance between corner sampling points Then, the distance Dx is constrained to the distance between sampling points. The distance between the corners of adjacent arrays can be set to a normalized value 1.0: then the positive distance Dx is normalized to a value between 〇〇 and 1 _ 0. As shown, the distance DT from the central corner C 〇 to the edge crossing position of the middle and upper corner CT is 40t, which is less than 10 (corner to corner -16- clothing paper size is applicable to China National Standard (CNS) A4 specification (210X297 Mm) -------- '1 installed ------ ordered (please read the precautions on the back before filling in this page) A7 B7 Ministry of Economic Affairs 4-Central Bureau of Standards, Male Worker Consumption Cooperation Du Yin System V. Description of the invention (14 complete distances) and count The calculated distance e and distance are stored as a data signal. The intersections at the central corner Co and the opposite right and left sides are the same. The distance DR and DL are also the same as 40. Because each normalized distance is less than the corner to The distance of the corner is "but it is not the case for the intersection and position under the adjacent corner cB" and therefore has a distance greater than-: the distance value is constrained to 10, indicating that the polygon exceeds the corner C (^ CB. That is, if The distance 0 is equal to the distance between the corner sampling points, and the polygon on the central corner point is also regarded as covering the corresponding adjacent sampling corner. The number of bits used in the data distance Dx is between 3 and 5 bits, but it can be combined because = and unified. Therefore, each corner sample point C is the address of a separate location in the video memory. The location contains data describing the color, transparency markings, and distance data related to the left, right, and fork positions. If the polygon at the sampling point is transparent, the transparency flag is also set.

由於螢幕距離一般由左到右由上到下增加,我們目前偏 好假設取樣排列的角落區間距離是1 · 〇且對右邊及下方交 又位置若交又位置距10或對左邊及上方交又位置若交 又位置距離是0.0則多邊形遮蓋相鄰的取樣點。因此,簡 單的距離資料字組截斷與約束將產生由左到右由上到下介 於〇.〇到1.0間的距離;若上或左交又位置是0.0,則多邊形 遮蓋了上方或左邊相鄰角落點,而若下或右交又位置是 1.0 ’則多邊形遮蓋了下方或右邊角落點。這只是一個簡 便的實施例,若有需要也可因特定使用而異。計算邊緣交 又位置距離的各種方法在電腦圖形中廣爲週知且普遍使用 必爲習於此藝者所熟知D •17 本纸張尺度適用中賴轉準(CNS ) A4^⑺Qx297公着) I I I I - I - I ' --I -- n I I {請先閒讀背面之注意事項存填寫本貫) A7 A7 經濟部中央標準局員工消費合作社印製 五、發明説明(15) π現在參考圖4,其中顯示了處理頂·點資料訊號輸入以求 侍顯π給觀看者2 〇的視頻輸出資料訊號的示範色彩強度副 ’.且σ 16a,其中使用了圖5a_5e中流程圖的程序。副組合的 第一個輸入Maq與邊緣遮斷計算裝置42的第一個輸入42& 配對,亚由其餘的顯示處理器丨6接收在(1,;)座標中的顯 不夕邊形頂點資料訊號:計算裝置的輸出42b是對接著被 處理的特定像素的正規化邊緣交又資料字組的集合。像素 (Lp ’ Pp)由來自副組合輸入i6a_2的裝置輸入42c的像素 攔位號碼P p資料,與來自副組合輸入丨6a_3的裝置輸入々2d 的顯示線L p號碼資料來描述3 出現在框架緩衝器(大量記憶體)裝置的第一個輸入4牦 的邊緣資料訊號,有顯示器無數個像素每—個的許多位元 深的儲存位置:每個位置由輸44c與44d的列線與像素欄位 資料字組唯一地指定(也就是由列線J〇s Lp s 'μ及欄位夏。 客PP s Lax)。框架緩衝器也在輸入44e接收多邊形色彩資 料訊號與副組合界面16a-4耦合,及在輸入44f接收透明度 '貝料訊號與S1〗組合界面16a-5核合。框架暫存器輸入階段 44a’以每個像素的基準儲存每個像素的色彩/透明度,邊緣 交又與標識等所有資訊。此資料也以每個像素的基準提供 給框架暫存器輸出44b :必須要知道的是,由於目前緩衝 器裝置如所顯示只有單一组像素指定輸入44c/44d,因此只 有下一個要定址的像素會在輸出44b收到輸入資料與供給 資料,同時要知道的是在所儲存的資料被取出並由一(或 多)個獨立地描述的不同像素位置輸出時要提供多组像素 -18· n - I - i: I - . - I I J, J, - - I — I— - n . U3. 、T (請先閲讀背面之注意事項再填寫本頁)Since the screen distance generally increases from left to right and from top to bottom, we currently prefer to assume that the distance between the corners of the sampling arrangement is 1 · 〇 and the intersection and position of the right and bottom if the intersection and position are 10 or left and above If the intersection distance is 0.0, the polygon covers adjacent sampling points. Therefore, simple distance data word truncation and constraints will produce a distance between 0.0 and 1.0 from left to right and top to bottom; if the top or left intersection and the position is 0.0, the polygon covers the top or left phase Adjacent corner points, and if the lower or right intersection and the position is 1.0 ', the polygon covers the lower or right corner points. This is just a simple example, and it can vary depending on the specific use if needed. Various methods for calculating the distance between edges and positions are widely known in computer graphics and must be widely used by artists who are accustomed to this. D • 17 This paper size is applicable to the Lai transfer standard (CNS) A4 ^ ⑺Qx297 (public) IIII-I-I '--I-n II (please read the notes on the back and fill in the text) A7 A7 Printed by the Employee Consumer Cooperative of the Central Standards Bureau of the Ministry of Economic Affairs V. Description of invention (15) π Refer to the figure now 4. It shows the demonstration of the color intensity of the video output data signal for processing the top-point data signal input to request the display π to the viewer 20. σ 16a, in which the procedure of the flowchart in FIGS. 5a-5e is used. The first input Maq of the sub-combination is paired with the first input 42 & of the edge occlusion computing device 42, and the remaining display processor 丨 6 receives the vertex data of the display polygon in the (1 ,;) coordinates Signal: The output 42b of the computing device is a set of normalized edge intersection data words for the specific pixels that are then processed. Pixel (Lp 'Pp) is described by the device input number 42c of the pixel input 42c from the sub-combination input i6a_2, and the display line L p number data of the device input from the sub-combination input 6a_3 2d 3 appears in the frame The first input of the buffer (mass memory) device is a 4-bit edge data signal, and there are countless pixels on the display, each with a storage location of many bits deep: each position consists of 44c and 44d lines and pixels The field data word group is uniquely specified (that is, by the line J〇s Lp s' μ and the field Xia. Guest PP s Lax). The frame buffer is also coupled to the input 44e to receive the polygon color data signal and the sub-combination interface 16a-4, and to receive the transparency 'shell material signal and S1〗 combination interface 16a-5 at the input 44f. The frame register input stage 44a 'stores all information such as the color / transparency of each pixel, the intersection of the edge and the logo on a per-pixel basis. This data is also provided to the frame register output 44b on a per-pixel basis: It must be known that since the current buffer device displays only a single set of pixel designation inputs 44c / 44d, there is only the next pixel to be addressed It will receive input data and supply data at output 44b. At the same time, it is necessary to provide multiple groups of pixels when the stored data is taken out and output by one (or more) different pixel positions independently described.-18 · n -I-i: I-.-IIJ, J,--I — I—-n. U3., T (please read the precautions on the back before filling this page)

318923 Α7 Β7 五、發明説明(16) 指名輸入讓輸入資料可以被載入到一(或多)個像素位置。 框架緩衝器輸出4 1 b提供選定的抗混淆角落與邊緣的排 列(在此是有關接著被處理的中央像素(L p,p p )的4個相 鄰像素的1 2個邊緣)的數位資料訊號給後處理裝置4 6的一 個輸入46a ’列線與像素欄位資料訊號則提供給其他輸入 46c與46d。邊緣暫存器由邊緣解析器46_2存取以決定目前 處理的像素被一多邊形表面的色彩/透明度屬性所覆藝的 部份:然後此資料被色彩混合器46_3用來設定目前像素 (L P ’ P p )的最後混合顏色並由後處理輸出46b傳遞該資料 ’ δ成是副組合輸出16&·6的視頻輸出資料訊號(可以顯示 或進一步處理,如有需要的話)。 經濟部中央標準局員工消費合作社印製 '-衣-- {請先閱讀背面之注意事項再填寫本頁) 邊緣遮斷計算器執行的處理步驟顯示在圖5 a的流程圖中 .像素列線L p及搁位P p資料訊號在步驟5 〇接收而多邊形 3 6的頂點資料訊號在步驟5 1接收。在步驟5 2中,顯示線 L迴路的開頭中,計算器決定由頂掃描線(其中ι = Ι〇)到底 掃描線(其中I = Imax)中哪條顯示線L至少在—個像素的一 邵份出現多邊形;這些掃描線號碼L暫時地被記錄起來且 設定了這些掃描線的第一個號碼L P。此掃描線號碼被輸 入到步驟5 3,在其中找到該掃描線的左右多邊形邊緣列線 遮斷JL與Jr ;這些界限也被暫時地儲存起來。步驟54由步 驟5 3中找到的界限(左到右)開始巢狀像素迴路,考慮在步 驟5 2中沿著掃描線l p確立的每個像素j p。在巢狀迴路内 部可找到步驟55,56,57與5 8,分別做:對像素的左上角 落C 〇尋找四個又叉位置c χ及該角落排列的相關的四個正 -19- 本纸張尺度適用中國國家標準(CNS ) Α4規格(210Χ297公釐) 經濟部中央標隼局員工消費合作社印製 20 五、發明説明(17) 規化距離Dx ;限制距離心在最大像素値1以内,若特a 距離D X大於1像素距離則並設定”覆蓋"標識(步驟5 5 )叱= 多邊形是透明的則在某些方向操作像素資料(透明度考: 將在底下作詳細討論);將角落c〇的色彩當成所 數如多邊:顏色,紋理效果(色彩,調頻,及其類似的: 的函數計异(步驟57);然後將相關資料訊號暫時地儲 視頻記憶⑴框架緩衝器44)。然後,進人步驟59而; 判足:下-順序像素的域是否會超出右邊界限Jr?若否, 可以進行孩Lp掃描線上的進一步像素處理:使用輸出 並進入步驟60,將迴路以卜;+1.返回到步驟54。若目前像 素在JR_h,下-像素不包含目前多邊形,&輸出別退出 迴路以便繼續處理下—掃描線L = (Lp + l)。進入步驟Η而 掃描線迴路判定:下—順序掃描線是否會超出該多邊形的 較低掃描線界限、”?若否,可以進行該.掃描線上的進— 步像素處理:使用輸出61a並進入步驟62以便掃描線迴路 眞正地以L=L+1返回到步驟5 2 ;然後將會通過該新掃描線 的像素迴路《若剛完成的掃描線在多邊形的底部上,下— 掃描,.泉不包含目多邊形,由輸出6 1 b退出迴路以便繼續 處理下一多邊形36,。當完成目前多邊形旳處理,則進入 步骤而多邊形迴路判定是否已考慮了目前視窗34中的 所有多邊形?若仍有其他多邊形.要處理,選擇出口 63a,在 步骤6 4推進多邊形指標並抓取下—多邊形頂點的集合(步 驟5 1 )。若典其他多邊形必須考慮,該顯示框架就不需要 在此系統的一部份中的進一步像素處理;由輸出63b退出318923 Α7 Β7 5. Description of the invention (16) Name input allows input data to be loaded into one (or more) pixel locations. The frame buffer output 4 1 b provides the digital data signal of the selected anti-aliasing corner and edge arrangement (here are 12 edges of the 4 adjacent pixels of the central pixel (L p, pp) that are processed next) One input 46a 'of the post-processing device 46' row line and pixel field data signals are provided to other inputs 46c and 46d. The edge register is accessed by the edge parser 46_2 to determine the portion of the currently processed pixel covered by the color / transparency properties of a polygonal surface: this data is then used by the color mixer 46_3 to set the current pixel (LP'P p) the final mixed color and pass the data by post-processing output 46b 'δ into a sub-combination output 16 & · 6 video output data signal (can be displayed or further processed if necessary). Printed by the Ministry of Economic Affairs, Central Bureau of Standards and Staff's Consumer Cooperatives-(Please read the precautions on the back before filling in this page) The processing steps performed by the edge occlusion calculator are shown in the flow chart in Figure 5a. The data signals of L p and the rest P p are received in step 50 and the vertex data signals of polygon 36 are received in step 51. In step 52, at the beginning of the display line L loop, the calculator determines which display line L from the top scan line (where ι = Ι〇) to the bottom scan line (where I = Imax) is at least one pixel Shao Fen appears a polygon; these scan line numbers L are temporarily recorded and the first number LP of these scan lines is set. The scan line number is entered in step 53, where the left and right polygon edge column lines of the scan line are found to block JL and Jr; these limits are also temporarily stored. Step 54 starts the nested pixel loop from the boundary (left to right) found in step 53, considering each pixel j p established along the scanning line l p in step 52. Steps 55, 56, 57 and 58 can be found inside the nested loop. Do the following: find the four cross positions c χ and the related four positive -19s arranged in this corner of the pixel's upper left corner C 〇 The Zhang scale applies the Chinese National Standard (CNS) Α4 specification (210 × 297 mm). Printed by the Employee Consumer Cooperative of the Central Standard Falconry Bureau of the Ministry of Economic Affairs. 20. 5. Description of the invention (17) The standardized distance Dx; limit the distance to the maximum pixel value of 1, If the distance a DX is greater than 1 pixel distance, then set the "overlay" mark (step 5 5) 叱 = polygon is transparent, then operate the pixel data in certain directions (transparency test: will be discussed in detail below); corner The color of c〇 is regarded as multi-sided: color, texture effect (color, frequency modulation, and the like: the function of the difference is calculated (step 57); then the relevant data signal is temporarily stored in the video memory (frame buffer 44). Then, go to step 59; Judgment: Will the domain of next-order pixels exceed the right boundary Jr? If not, you can perform further pixel processing on the Lp scan line: use the output and go to step 60, and loop back to Bu +1. Return to step 54. If the current pixel is in JR_h, the next pixel does not contain the current polygon, & output do not exit the loop to continue processing-scan line L = (Lp + l). Enter step Η and scan line Loop judgment: Next—Will the sequential scan line exceed the lower scan line limit of the polygon, "? If not, you can do this. Advanced pixel processing on the scan line: use output 61a and go to step 62 so that the scan line loop returns to step 5 2 with L = L + 1; then it will pass the new scan line The pixel loop of "If the scan line just completed is on the bottom of the polygon, down-scanning, the spring does not contain the target polygon, and the output 6 1 b exits the loop to continue processing the next polygon 36. When the current polygon processing is completed, the step is entered and the polygon loop determines whether all polygons in the current window 34 have been considered? If there are still other polygons. To process, select the exit 63a, advance the polygon index in step 6 and grab the set of polygon vertices (step 5 1). If other polygons must be considered, the display frame does not require further pixel processing in a part of this system; exit from output 63b

本紙張尺細中(CNS n —1 n n n n n --- ' i^- —— I I ! I 丁 *ye (請先閲讀背面之注意事項再填寫本頁} A7 B7 五、發明説明(18) 以便繼續處理下一影像視窗框架的資料訊號並開始該顯示 框架的像素資料的邊緣遮斷計算處理。 透明度 母個多邊形表面3 6有一定的,已知的透明程度。我們將 透明程度正規化以便可以用介於〇 〇 (完全透明)與丨〇 (完全 不明)間的數目代表此透明度。透明度藉由忽略或使特 定像素角落取樣點失效而達成,如此即使多邊形落在(也 就是遮蓋)取樣角落點上,多邊形特性資料也不會寫到該 像素角落的視頻記憶體:與此忽略的角落相關的邊緣交叉 位置也不會寫到記憶體中。依據透明度的數字透過使取樣 點失效的方式,便可以看到視覺上在透明多邊形後面的多 邊形。失效的取樣點越多,多邊形越透明。這就像在透明 的多邊形上戳洞看看後面是什麼。一個樣式選擇碼及透明 度値會指定给多邊形。透明度値指示要使多少個取樣點失 效’而樣式選擇指示要使哪個取樣點失效。 經濟部中央榡率局貝工消費合作社印袈 I ! -I II ! II - »1! ' '士^II - - I II 丁 U3. .-¾ (請先閱讀背面之注意事項再填寫本頁) 失效處理可以參考圖6a來瞭解,其中顯示了兩種樣式選 擇(PS)位元的五個不同的透明程度τ。可以看到對不同範 圍的T程度,在低二進位程度(ps=〇)樣式選擇位元的透明 度失效樣式是以在高二進位程度(PS= 1)樣式選擇位元補足 的。雖然只顯示了五種程度的透明度T ’有更多的透明度 可以計算。 丁程度的數字由修改邊緣交叉位置來完成,如圖6b-6e 中所示,就像透明度的函數一樣。多邊形表面越透明,區 域中被指派的取樣點越少。此程序增加或減少多邊形區域 -21 - 本紙張尺度適用中國國家標準(CNS ) A4g ( 210 X 29?公釐) 318923 經濟部中央標準局員工消費合作社印製 A7 B7 五、發明説明(19) ~~ - 中的取樣角落點:如圖6 b中所見,透明程度τ非常低 (0<Τ<1/4)只有一個像素角落Ca在所選樣式中,而同一像 素的其他角落cb,Cc,Cd失效而不被考慮;左右交又位置 被向w移動到取樣點,因此距離1>1^及1:)1^分別成爲i 〇與 〇_〇 ’而修正的底部交又位置距離D,Ba成爲(4*T*Dh),其 中DBa是未修正的底部交又位置4〇"到再落c a的距離。相 同地,頂部交又位置4〇,距離DTa修正爲D,h=丨_(4*τ*(〇· DTa)),其中D疋單元像素邊緣段距離。當透明程度丁增加 ’邊緣交又位置被移向遠離角落取樣點,因而增加多邊形 表面在所考慮像素的有效區域。· 圖6 c顯示了當1 /4 s T g 1 /2的情況:使用了一對像素角 落(在此是角落(:3與Cc)而一對角落(Cb與Cd)失效而不被考 慮。對頂角落點Ca ’左右叉又位置仍然向前移動到取樣點 ’因此距離DLa及DRa仍然分別成爲1.0與〇.〇 :頂部及底部 义叉位置距離DTa與DBa並不修正=> 對底角落點cc,當修正 的右交又位置距離D,Rc成爲(4*(T-1/4)*DRc)時,其中dRc 是未修正的角落C c的底部叉又位置距離,頂部及底部交又 位置距離DTc及DBc分別成爲1 .〇與〇.〇。相同地,左交叉位 置距離 DLc修正成爲 D,Lc=l-(4*(T-l/4)*(D-DLc))。 圖6d顯示了當1/2ST各3M的情況:使用了三個像素角落 (在此是角落Ca,(^與Cd)而只有一個角落(cb)失效而不被 考慮。頂角落點Ca的左右交又位置距離DLa及DRa仍然分別 成爲1.0與0·0 ’頂部及底部交叉位置距離DTa與DBa並不修 正。對底角落點Cc的左右交又位置距離維持在及DRc不 -22- 本紙張尺度適用中國國家橾準(CNS ) A4規格(210X297公釐) .裝-- f請先閲讀背面之注意事項再填寫本頁j .βτ 經濟部中央標準局員工消費合作社印褽 318923 A7 A7 * B7 五、發明説明(20) 變時,頂邵及底邵X叉位置距離分別維持在1 _ 0與0.0。C d 角落的距離被修正’右左交叉位置距離分別被限制在i 〇 與0.0的値。底部父又位置距離Dgd成爲(4*(T-l/2)*DBd)時 ’其中D B d是不修正的底部交叉位置距離。相同地,頂部 交又位置距離DTd修正成爲C,Td=l-(4*(T-l/2)*(D-DTd))。 最後,圖6d顯示了當3/4含TS0.999的情況:因爲使用所 有四個角落隱含著T= 1的不透明,因此只使用了三個像素 角落(負落Ca,(^與^)而一個角落(Cb)失效;只檢查角落 C b的有效性是爲了判定充全不透明(T = 1. 〇)。頂角落點c a 的左右交叉位置距離DLa及DRa分別被修正爲D,La=l(4*(T- 3/4)*(D-DLa))與 D_Ra = (4*(T-3/4)*(D-DRa)):頂部及底部交 又位置距離DTa與DBa並不修正。當左下角落點Cc的左右交 又位置距離維持在DLc及DRc不變時,頂部及底部交又位置 距離分別維持在1 · 0與0· 0。當右下角落cd的頂部及底部交 又位置距離分別維持在其原始値DTd與DBd時,其右左交叉 位置距離仍然分別被限制在i .〇與〇.〇。 上面所討論程序的效應在增加或減少組成取樣角落點的 多邊形區域,如圖6f (PS = 〇)與圖6g (PS=1)中所示。對 PS = 〇 ’若透明度値T介於〇與1/4間,則當τ增加時取樣角 落Ca的區域増加(更不透明),如箭號xa所示。若1/4运 T< 1/2 ’則當T增加時取樣角落Cc的區域增加,如箭號&所 示’而若1/2 S T<3/4,當T增加時取樣角落Cd的區域增加 ’如箭號Xc所示。箭號Xd是取樣角落C c在順時針方向的 增加’與其他箭號的CCW増加相反,若是Τ>3/4。PS=1得 -23- n J -· I « - - ...*"-II - - - .....1 I T* *τ (請先聞讀背面之注意事項再填寫本頁) 一 I - - 釐 公 經濟部中央標準局貝工消費合作社印製 A7 --------- B7___ _ 五、發明説明(21) 〜 到相反的改變,如圖6g中所示。每個多邊形覆蓋像素的區 域可以隨機地指派樣式選擇組態,這將有助於根據所有侵 害孩像素的多邊形的透明度,優先順序及色彩推論出整個 像素色彩資訊。 後記憶體處理 解決了框架缝衝器之前的角落色彩及透明度考量之後, 一序列的貝料訊號修正步驟7 〇 _ 8 〇在後處理器-邊緣解析 為處理’如圖5 b中的流程。這些步驟可以用邊緣交又位置 /角洛貧料訊號修正步驟5 〇 _ 6 5以時間無關或時間相關(最 好是交錯)的方式施行。在框架緩衝器中的不論何種像素 資訊都會被使用:因此,若遮斷計算變得進退兩難或緩慢 ,先珂儲存的資料訊號會被使用a邊緣解析處理由步驟7 〇 開始,由被存取的框架緩衝器4 4取得像素(L p,p幻角落 C〇排列肾料訊號,它與沿著四個順序邊緣(E+1)到(E_2)上 排列的十六個角落C11_C44(圖5b,)相關。_組十二個角落 到角落邊緣段S0-SU在步驟71設定,每個—般化的像素邊 緣段Sx(圖5b")在一對角落(^與〇^間伸展且每個角落有與 其相關的X又位置距離〇乂或Dw。爲取得每個邊 ,首先進入判斷步驟72並做是否Dv與Dw兩者都覆蓋邊緣 段sx的初始判斷。若是,則正規化邊緣段長度1 一定是 〇·5(步骤73);若否,步驟74判斷是否〜與〇二距:: 小於距離SX3若是,邊緣段長度就是所考慮的角落的相關 距離(例如對角落Cv,L=Dv),如步驟7 5中所設定:若否 ,進入步報76檢查兩個角落的透明度。若只有—個角落交 _ -24- 本紙張尺度適用+國國家標準YcNS ) A4邸·( 21〇·〆297公竣〆 ' (請先閱讀背面之注意事項再填寫本頁) -裝· 訂 318923 A7 B7 _ 五、發明説明(22) (請先閲讀背面之注意事項再填寫本頁) 叉位置透明,步驟7 7使邊緣段長度1等於其相關的距離並 且設定透明度標識,但若兩個交又位置都透明,步驟7 8將 邊緣段長度1設定成距離與Dw的平均。所有步驟7 3, 7 5,7 7及7 8都退出到步驟7 9,其中邊緣段數字Sx (0 S S g 11)用來檢查該像素是否有其他邊緣段需要處理。若是 ,步驟8 0將邊緣段數字S遞增一後返回步驟7 1的處理:若 否,邊緣段資訊資料訊號準備傳給色彩混合器。 經濟部中央橾準局員工消費合作社印製 現在參考圖7,後處理器裝置46的邊緣暫存器與邊緣解 析器部份4 6 - 1與4 6 - 2,可以用專門的邏輯裝置代替特別 設計的計算單元,在輸入匯流排8 1接收來自框架緩衝器的 角落資料輸入訊號。三個先進先出的資料暫存器82a-82c 依序連接,以便四個順序的邊緣資料訊號串中短暫不同的 一個出現在匯流排8 1 a-8 1 d中的每一個。在目前像素掃描 線L的較低邊緣E上的角落之資料會在匯流排8 1 b上,而暫 存器裝置82b已在匯流排8 1 c上讓所儲存的緊隨於前的掃描 線的角落資料訊號可以使用並因而提供邊緣(E-1 ),且暫存 器裝置82c已在匯流排8 1 d上讓所儲存的在邊緣(E-1)之前 的邊緣(E-2)的資料訊號可以使用。然後下—邊緣(E+i)在 匯流排8 1 a成爲目前可以使用:因此,將可看到在掃描線l 上的每個像素P只有在下一順序邊緣(E+1)的資料被儲存且 可以使用後才會被處理,它需要下一掃描線(L+1)之可用 性。在任何情況中,角落節點C 4 4,C 3 4,C 2 4與C 14保留 將被輸入(下一時脈)到保留暫存器裝置8 4中相關的下一個 的目前資訊’如:暫存器裝置84a在其輸出有角落節點C43 -25- 本紙張尺度適用中國國家標準(CNS ) A4規格(210X297公釐) A7 ____B7 五、發明説明(23) 的資料;暫存器裝置84b在其輸出有角落節點C33的資料: 暫存器裝置84c在其輸出有角落節點C23的資料;暫存器裝 置84d在其輸出有角落節點C 13的資料。兩組下一序列暫存 器85a-85d及86a-86d保留下一序列的其他像素資料,以分 別對不同的角落節點C42,C32,C22,C12及C41,C31, C2 1,C 1 1提供資料訊號。與適當相關的角落資料訊號節 點配對的是十二個邊緣段計算裝置88a-881中的一個,每一 個在其相關的輸出88a'-881'提供所計算出的邊緣段長度1資 料訊號。因此’ S〇邊緣段長度]_〇’資料訊號由連接在節點 C12與C22間的計算裝置88a提供;Sl邊緣段長度1S1資料訊 號IV由連接在節點C13與C23間的計算裝置88b提供:52邊 緣段長度iS2資料訊號]_2'由連接在節點C21與C22間的計算 裝置8 8 c提供;S 3邊緣段長度3資料訊號L ’由連接在節點 C22與C23間的計算裝置88d提供;及依此繼續,直到su 邊緣段長度is丨丨資料訊號]^丨’由連接在節點C33與C43間的 计鼻裝置8 81提供。然後目前所處理的像素(l p,p p )的所 有十二個邊緣段長度資料訊號被送到色彩混合裝置4 6 - 3。 經濟部中央標準局貝工消費合作社印製 "袭-- (請先閲讀背面之注意事項再填寫本頁) 爲顯示每個像素3 6的適當色彩資訊,1 6 (4 X 4 )個相鄭 取樣角落C i! -C44(見圖5 c )由視頻記憶體中取出:圍繞像 素(L p ’ P p )的取樣角落點將被計算。最終的目標是要混 合一組四個角落混合色彩B ’例如上左(ti)角落ct i的混合 色彩Btl,上右(tr)角落Ct#混合色彩bu,下左(bl)角落 Cbl的混合色彩Bbl,及下右(br)角落cbr的混合色彩Bbr,每 一個是由各別的角落Cjj取樣色彩Cij,計算出,透過: -26- 本紙張尺度適用中國國家揉準(CNS ) A4規格(210X297公釐) A7 318923 五、發明説明(24)The size of this paper is (CNS n —1 nnnnn --- 'i ^-—— II! I 丁 * ye (please read the precautions on the back before filling in this page) A7 B7 V. Invention description (18) to continue Process the data signal of the next image window frame and start the calculation of the edge occlusion of the pixel data of the display frame. Transparency The polygon surface 36 has a certain, known transparency. We normalize the transparency so that it can be used The number between 〇〇 (completely transparent) and 丨 〇 (completely unknown) represents this transparency. Transparency is achieved by ignoring or disabling the sampling point of a particular pixel corner, so that even if the polygon falls on (ie, obscures) the sampling corner point In the above, the polygon characteristic data will not be written to the video memory of the corner of the pixel: the edge intersection position related to this ignored corner will also not be written to the memory. According to the transparency number, the sampling point is invalidated by the way of invalidating the sampling point. You can see the polygon visually behind the transparent polygon. The more sampling points that fail, the more transparent the polygon. This is like poking a hole in a transparent polygon See what's behind. A style selection code and transparency value will be assigned to the polygon. The transparency value indicates how many sampling points to invalidate and the style selection indicates which sampling points to invalidate. Central Bureau of Economy, Ministry of Economic Affairs, Beigong Consumer Cooperative印 袈 I! -I II! II-»1! '' 士 ^ II--I II 丁 U3. .-¾ (please read the precautions on the back before filling in this page). For failure treatment, please refer to Figure 6a. It shows five different degrees of transparency τ for the two style selection (PS) bits. It can be seen that for different degrees of T degrees, the transparency failure style of the bit selection at the low binary degree (ps = 〇) style is In the high binary degree (PS = 1) style, select the bit complement. Although only five levels of transparency T 'are shown, more transparency can be calculated. The number of D-levels is completed by modifying the edge intersection position, as shown in the figure As shown in 6b-6e, just as a function of transparency. The more transparent the polygonal surface, the fewer sampling points assigned in the area. This procedure increases or decreases the polygonal area. 21-This paper scale applies the Chinese national standard Standard (CNS) A4g (210 X 29? Mm) 318923 A7 B7 printed by the Employee Consumer Cooperative of the Central Bureau of Standards of the Ministry of Economy V. Invention description (19) ~~-Sampling corner points in: as seen in Figure 6b, transparent The degree τ is very low (0 < Τ < 1/4) only one pixel corner Ca is in the selected style, while the other corners cb, Cc, Cd of the same pixel are invalid and are not considered; the left-right intersection is moved to w to Sampling point, so the distance 1> 1 ^ and 1 :) 1 ^ become i 〇 and 〇_〇 'and the corrected bottom intersection position distance D, Ba becomes (4 * T * Dh), where DBa is uncorrected The bottom crosses the location 4〇 "to the distance from the fall again. Similarly, the position of the top intersection is 4 °, and the distance DTa is corrected to D, h = 丨 _ (4 * τ * (〇 · DTa)), where D is the distance of the pixel edge segment. When the degree of transparency increases, the edge intersection position is moved away from the corner sampling point, thus increasing the effective area of the polygon surface in the pixel under consideration. · Figure 6c shows the situation when 1/4 s T g 1/2: a pair of pixel corners (here corners (3 and Cc) are used and a pair of corners (Cb and Cd) are invalid and are not considered . For the top corner point Ca, the left and right forks are still moving forward to the sampling point. Therefore, the distances DLa and DRa are still 1.0 and 0.0, respectively: the distance between the top and bottom sense forks DTa and DBa is not modified => The bottom corner point cc, when the corrected right-hand intersection and position distance D, Rc becomes (4 * (T-1 / 4) * DRc), where dRc is the uncorrected corner C c bottom fork position distance, top and The bottom intersection position distances DTc and DBc become 1.0 and 0.0, respectively. Similarly, the left intersection position distance DLc is corrected to D, Lc = l- (4 * (Tl / 4) * (D-DLc)). Fig. 6d shows the situation when each of the 1 / 2ST is 3M: three pixel corners (here, corner Ca, (^ and Cd) are used and only one corner (cb) is invalid and not considered. The top corner point Ca is about The intersection position distance DLa and DRa are still 1.0 and 0 · 0 '. The top and bottom intersection position distance DTa and DBa are not modified. The left and right intersection point position of the bottom corner point Cc is maintained at DRcNo-22- This paper scale is applicable to China National Standard (CNS) A4 (210X297mm). Packing-f Please read the precautions on the back before filling this page j. Βτ Employee Consumer Cooperative of the Central Standards Bureau of the Ministry of Economic Affairs印 褽 318923 A7 A7 * B7 Fifth, the description of the invention (20) When changing, the distance between the top and bottom X fork positions are maintained at 1 _ 0 and 0.0. C d The distance between the corners is corrected. The distance between the right and left cross positions is limited. The value of i 〇 and 0.0. When the bottom parent position distance Dgd becomes (4 * (Tl / 2) * DBd) 'where DB d is the bottom cross position distance that is not corrected. Similarly, the top cross position distance is corrected by DTd Become C, Td = l- (4 * (Tl / 2) * (D-DTd)). Finally, Figure 6d shows the situation when 3/4 contains TS0.999: because the use of all four corners implies T = 1 is opaque, so only three pixel corners (negative drop Ca, (^ and ^) and one corner (Cb) are invalid; only checking the validity of corner C b is to determine that it is fully opaque (T = 1. 〇). The distance DLa and DRa at the top and bottom corner points ca are corrected to D, La = l (4 * (T-3 / 4) * (D-DLa)) and D_Ra = (4 * (T- 3 / 4) * (D-DRa)): The distance between the top and bottom intersections DTa and DBa is not modified. When the left-right intersection and bottom position distance of the lower left corner point Cc is maintained at DLc and DRc, the top and bottom intersection positions The distance is maintained at 1 · 0 and 0 · 0, respectively. When the top and bottom intersection positions of the bottom right corner cd are maintained at their original values DTd and DBd, respectively, their right and left intersection position distances are still limited to i.〇 and 〇.〇, respectively. The effect of the procedure discussed above is to increase or decrease the polygon area that makes up the sampling corner points, as shown in Figure 6f (PS = 〇) and Figure 6g (PS = 1). For PS = 〇 'If the transparency value T is between 0 and 1/4, the area where the sampling angle falls Ca increases as τ increases (more opaque), as indicated by the arrow xa. If 1/4 transport T < 1/2 ', the area of the sampling corner Cc increases when T increases, as shown by the arrow &' If 1/2 S T < 3/4, the sampling corner Cd when T increases The area increase is shown by the arrow Xc. The arrow Xd is the increase of the sampling corner C c in the clockwise direction. Contrary to the increase of the CCW of other arrows, if it is T> 3/4. PS = 1 得 -23- n J-· I «--... * " -II---..... 1 IT * * τ (please read the precautions on the back before filling this page) 1. I--Printed by the Pongong Consumer Cooperative of the Central Standards Bureau of the Ministry of Economic Affairs A7 --------- B7___ _ V. Description of the invention (21) ~ To the opposite change, as shown in Figure 6g. The area covered by pixels of each polygon can be randomly assigned a style selection configuration, which will help to infer the color information of the entire pixel based on the transparency, priority order and color of all polygons that violate the child pixels. Post-memory processing After solving the color and transparency considerations of the corners before the frame punch, a sequence of shell material signal correction steps 7 _ 8 〇 in the post-processor-edge analysis for processing 'process shown in Figure 5b. These steps can be performed in a time-independent or time-dependent (preferably interleaved) manner using the edge intersection position / corner lean signal correction step 5 _ 6 5. No matter what kind of pixel information is used in the frame buffer: Therefore, if the occlusion calculation becomes a dilemma or slow, the data signal stored by Xianke will be used a. Edge analysis processing starts at step 7 and is accessed by The frame buffer 4 4 obtains pixels (L p, p magic corner C〇 arranged kidney material signal, which is arranged along the four sequential edges (E + 1) to (E_2) sixteen corners C11_C44 (Figure 5b ,) Related. _ Set of twelve corner-to-corner edge segments S0-SU set in step 71, each generalized pixel edge segment Sx (Figure 5b ") stretches between a pair of corners (^ and 〇 ^ and each The corners have X and Dw distances associated with them. To obtain each edge, first enter the judgment step 72 and make an initial judgment whether both Dv and Dw cover the edge segment sx. If so, normalize the edge segment The length 1 must be 0.5 (step 73); if not, step 74 judges whether it is ~ two distances from: :: less than the distance SX3. If it is, the length of the edge segment is the relative distance of the corner considered (for example, for corner Cv, L = Dv), as set in step 75: if not, go to step 76 to check the two The transparency of the corners. If there is only one corner _ -24- This paper size is applicable + national standard YcNS) A4Di · (21〇 · 〆297 Gongjuan〆 '(please read the precautions on the back before filling this page )-Binding · Order 318923 A7 B7 _ 5. Description of the invention (22) (Please read the precautions on the back before filling in this page) Fork position is transparent, step 7 7 Make the edge segment length 1 equal to its relevant distance and set the transparency sign , But if both intersections and positions are transparent, step 7 8 sets the edge segment length 1 to the average of the distance and Dw. All steps 7 3, 7 5, 7 7 and 7 8 exit to step 7 9, where the edge segment The number Sx (0 SS g 11) is used to check whether the pixel has other edge segments that need to be processed. If yes, step 8 0 increments the edge segment number S and returns to step 71: if not, the edge segment information data signal is prepared Passed to the color mixer. Printed by the Employee Consumer Cooperative of the Central Department of Economics of the Ministry of Economic Affairs. Now referring to FIG. 7, the edge registers and edge parser parts of the post-processor device 46 are 4 6-1 and 4 6-2 and can be used. Special logic devices replace specially designed calculations In the input bus 81, the corner data input signal from the frame buffer is received. The three first-in first-out data registers 82a-82c are connected in sequence so that the four sequential edge data signal strings are temporarily different Appears on each of the bus bars 8 1 a-8 1 d. The data at the corner on the lower edge E of the current pixel scan line L will be on the bus bar 8 1 b, while the register device 82b is already on the bus Row 8 1 c makes the stored corner data signal of the immediately preceding scan line available and thus provides an edge (E-1), and the register device 82c has made the stored data on the bus 8 1 d The data signal of the edge (E-2) before the edge (E-1) can be used. Then the lower-edge (E + i) becomes available at the bus 8 1 a: therefore, it will be seen that each pixel P on the scan line l only the data at the next sequential edge (E + 1) is stored And it will be processed after it can be used, it needs the availability of the next scan line (L + 1). In any case, the corner nodes C 4 4, C 3 4, C 2 4 and C 14 reservations will be input (next clock) to the next current information in the reservation register device 8 4 'eg: temporary The memory device 84a has a corner node C43 -25 at its output. This paper size is applicable to the Chinese National Standard (CNS) A4 specification (210X297 mm) A7 ____B7 5. Information of the invention description (23); the temporary device 84b is in its The data of the corner node C33 is output: the register device 84c outputs the data of the corner node C23; the register device 84d outputs the data of the corner node C13. Two sets of next-sequence registers 85a-85d and 86a-86d retain other pixel data of the next sequence to provide for different corner nodes C42, C32, C22, C12 and C41, C31, C2 1, C1 1 respectively Information signal. Paired with appropriately related corner data signal nodes is one of the twelve edge segment computing devices 88a-881, each of which provides the calculated edge segment length 1 data signal at its associated output 88a'-881 '. Therefore, the 'S〇 edge segment length] _〇' data signal is provided by the computing device 88a connected between the nodes C12 and C22; the S1 edge segment length 1S1 data signal IV is provided by the computing device 88b connected between the nodes C13 and C23: 52 The edge segment length iS2 data signal] _2 'is provided by the computing device 8 8 c connected between the nodes C21 and C22; the S 3 edge segment length 3 data signal L' is provided by the computing device 88d connected between the nodes C22 and C23; and Continue on until the length of the edge segment of the su is the data signal] provided by the nose gauge device 8 81 connected between the nodes C33 and C43. Then all twelve edge segment length data signals of the pixel (l p, p p) currently processed are sent to the color mixing device 4 6-3. Printed by the Beigong Consumer Cooperative of the Central Standards Bureau of the Ministry of Economic Affairs-(please read the precautions on the back before filling out this page) In order to display the appropriate color information for each pixel 36, 1 6 (4 X 4) phases The Zheng sampling corners C i! -C44 (see Figure 5c) are taken out of the video memory: the sampling corner points around the pixels (L p 'P p) will be calculated. The final goal is to mix a set of four corners to mix colors B 'such as the upper left (ti) corner ct i mixed color Btl, the upper right (tr) corner Ct # mixed color bu, and the lower left (bl) corner Cbl The color Bbl and the mixed color Bbr of the lower right (br) corner cbr, each of which is sampled from the respective corner Cjj and the color Cij, is calculated by: -26- This paper size is applicable to China National Standard (CNS) A4 specification (210X297mm) A7 318923 5. Description of the invention (24)

tl_blend_color BfCCH’+C^+C^+CjJM I n n n n n I I \ n- n In n I I— T *T (請先閱讀背面之注意事項再填寫本頁) tr_blend_color Btr=(C13'+C14,+C23,+C24,)/4 bl_blend_color Bbl=(C31,+C32,+C41,+C42,)/4 br—blend_color Bbr=(C33,+C34,+C43'+C44’)/4。 參考圖5 c ’ 5 d及5 e,色彩混合器包括小多邊形過遽處 理(圖5 d )跟著色彩計算處理(圖5 e )。 小多邊形過濾器 當大部份多邊形表面3 6大到足夠蓋住多個像素3 8,讓多 邊形剛好只蓋住單一像素便有可能。而在某種程度上讓多 邊形小到無法完全蓋住一像素也有可能。.比—像素小的多 邊形’或其大小少於角落取樣點距離區間D,會閃爍不定 ’因爲在某些位置,多邊形落在取樣角落上而可以看見, 而在其他位置上多邊形落在取樣角落間而無法看見。小多 邊形可以偵測及過濾(除去或抹掉)來降低閃爍。要如此做 ,目前像素3 6四個角落Ctl,Ctr,Cb丨與Cbr的每一個都要獨 經濟部中央標準局員工消費合作社印製 立地考慮。根據覆蓋角落取樣點的多邊形的大小來計算混 合値。混合色彩是以取樣點的色彩混合而成。多邊形越小 越多混合色彩用來代替取樣點色彩。邊緣段交叉位置長度 L被用來計算每個角落的混合値。這可用下面程序完成, 用角落Ctl當步驟90a的範例,計算表示各種距離的混合値 。首先’找出垂直長度]_vert及水平距離]_horz (步驟9 1 ): 然後決定第一及第二混合係數Blend」與Blend_2(步驟92) ,並取最小的從而(步驟93)得到Blend_tl係數。將 Blend_tl係數與1.0比較而將之正規化(步骤9 4 ),若有需要 -27- 本紙伕尺度適用中國國家標準(CNS ) A4規格(210X 297公麥) 經濟部中央榡準局員工消費合作社印裝 Α7 Β7 五、發明説明(25) 並將之限制在最大値丨(步驟95)。步骤96將上述四個角落 色彩平均’然後步驟9 7判定對X = 0,2,3,4,5或1 〇, 也就是在邊緣段S0,S2,S3,S4,S54S1()(邊緣段若延伸 將通過角落cu)上是否有任何交叉位置距離是由透明多 邊形取得的。若是,混合色彩値被忽略(步驟9 8 )而設爲〇 ’备未涉及透明多邊形,步驟9 9找出blended tl color B ,, ’當成爲最後tb_blend_color値Btl。此處理在步驟90b重複 以找出此像素其他三個取樣點的色彩,也就是對上右角落 Ctr ’下左角落cbl及下右角落cbr分別找到最後的混合色彩 値 Btr,Bb丨及 Bbr。 現在參考圖5 e,色彩混合器4 6 - 3的最後色彩計算處理 理句步驟9 2開始,在其中計算像素的四邊(邊緣段%^, S6與S8)未被覆蓋的交叉位置數。邊緣計數(必須是零或至 少爲二)與透明度條件在步驟9 3中使用。若有2個邊緣交叉 位置且四個取樣角落沒有一個被透明多邊形覆蓋(由透明 度標識的檢查判定)則假設單一多邊形邊緣穿過目前像素 :必須計算兩個區域(第一個多邊形覆蓋區域A 1與另一個 多邊形覆蓋區域A2)。這可在圖8a-8f的考慮中發現,其 中顯示了 2邊緣交又位置狀況的六種可能情況:在圖8 a中 ’邊緣3 9接近垂直且將邊緣段s3切割成兩部份(左邊部份 的正規化長度込及,由於任何像素邊緣段正規化的總長度 都是1,右邊部份的正規化長度(1 - b));底部邊緣段$8被 切割成兩部份(左邊部份的正規化長度^及,右邊部份的正 規化長度(1_U) -區域AIrrO.VL+U及區域A2=1-A1(在 -28- 本紙張尺度適用中國國家標準(CNS ) A4規格(21〇χ297公釐) f請先閲讀背面之注意事項再填寫本頁} 裝· 訂 A7 B7 五、發明説明(26 ) 所有情形下),其中像素色彩C P由下式決定 CP 〇.) (Ctl 色彩+Cbi 色彩)*Al+〇5*(Ctr 色彩+Cbr 色彩 在圖8 b ,,邊緣3 9接近水平且將左邊緣段~切割成兩部 伤(乙/卩知的正規化長度Is及,底部份的正規化長度(卜込)) ,右邊’象奴Se被切割成兩部份(頂部份的正規化長度u及, 底1 6的正規化長度(1 _ I·6))-區域A 1 = 〇· 5 ( ^5+ ]_6),其中像 素色彩C P是 CP-〇.”(Ctl 色彩+Ctr 色彩)*A1+0 ”(Cbi 色彩+ Cbr 色彩”A2。 相同地,在圖8 c的情形中,區域A 1 = 0 · 3 (]_5 * L),像素色 彩 _ CP = (CU 色彩)*Al+l/3(Cbl 色彩+Cbr 色彩+Cu 色彩)*A2。 在圖8d的情形中,a1=0 5(1_i5)*l8, CP = (Cbi 色彩)*Al+l/3(Ctl 色彩+Cbr 色彩+Ctr 色彩)*Α2。 在圖 8 e 的情形中,A 1 = 0.5 ( 1 - ]_3) * ]_6, CP=(Ctr 色彩)*Al + l/3(Ctl 色彩+Cbr 色彩+Cbl 色彩)*A2。 最後’對圖 8 f 中的情形,a 1 = 0.5 (( 1 - ]_8) * ( 1 - L)), CP=(Cbr 色彩)*Al + l/3(Ctl 色彩+Cbl 色彩+Ctr 色彩)*A2。 若無兩個邊緣交叉位置,或若透明度標識位元設在四個角 落取樣點中的任何一個,則像素被當成有四個分別區域 A 1 ’ A 2,A 3與A 4與4交叉位置處理;必須使用區域加權 良紙張尺度適用中國國家樣準(CNS )靖淑(2丨os7公釐 (請先閱讀背面之注意事項再填寫本頁} -裝. 訂 經濟部中央標準局員工消費合作社印製 29- 318923 A7 B7 五、發明説明(27) 計算步驟95。以圖形顯示在圖8g中;計算的區域如: A 1 = 1/4( lj+Is) Α2 = ι/4(( 1·[3)+]_6) Α3 = ι/4(( 1-1.5)+18) Α4= 1/4(( 146) + (148)) 最後的混合像素色彩C Ρ資料是: CP=(Ctl 色彩)*Al+(Ctr 色彩)*A2 + (Cbl 色彩)*A3 + (Cbr 色彩)*Α4。 像素的混合色彩C Ρ資訊在步驟9 4或9 5做了最後的決定, 此像素色彩資料訊號輸出到顯示器,以呈現給觀看者7 〇 3 在此詳細描述了在電腦影像產生器中決定像素色彩内容 的裝置與方法的較佳實施例,許多變化與修正對習於此献 者將顯而易見。因此我們將只用所附的專利申請项目内容 限制範圍而不採用在此解釋的特定工具與步驟的方法。 n^— —^1·- I- I - m Ϊ - m^i I— I mm - ^ (請先閲讀背面之注意事項再填寫本頁) 經濟部中央標準局負工消费合作社印製 -30- 本纸張尺度適用中國國家標準(CNS ) Α4規格(210Χ 297公釐)tl_blend_color BfCCH '+ C ^ + C ^ + CjJM I nnnnn II \ n- n In n II— T * T (Please read the precautions on the back before filling this page) tr_blend_color Btr = (C13' + C14, + C23, + C24,) / 4 bl_blend_color Bbl = (C31, + C32, + C41, + C42,) / 4 br—blend_color Bbr = (C33, + C34, + C43 '+ C44') / 4. Referring to Figures 5c '5d and 5e, the color mixer includes small polygon processing (Figure 5d) followed by color calculation processing (Figure 5e). Small Polygon Filter When most polygonal surfaces 36 are large enough to cover multiple pixels 38, it is possible for the polygon to cover only a single pixel. To some extent, it is possible to make the polygon too small to completely cover one pixel. .Polygons that are smaller than a pixel 'or whose size is less than the distance D of the sampling point of the corner, will blink ‘because at some locations, the polygon falls on the sampling corner and can be seen, while in other positions the polygon falls on the sampling corner Can't see from time to time. Small polygons can be detected and filtered (removed or erased) to reduce flicker. To do this, each of the four corners Ctl, Ctr, Cb, and Cbr of pixels 3 6 must be printed independently by the Employee Consumer Cooperative of the Central Bureau of Standards of the Ministry of Economy. The mixed value is calculated according to the size of the polygon covering the corner sampling point. The mixed color is formed by mixing the colors of the sampling points. The smaller the polygon, the more mixed colors are used to replace the sampling point colors. The length L of the intersection of the edge segments is used to calculate the mixed value of each corner. This can be done using the following procedure, using the corner Ctl as an example of step 90a to calculate the mixed values representing various distances. First, find the vertical length] _vert and horizontal distance] _horz (step 9 1): Then determine the first and second mixing coefficients Blend ”and Blend_2 (step 92), and take the smallest one (step 93) to obtain the Blend_tl coefficient. Compare the Blend_tl coefficient with 1.0 and normalize it (step 9 4), if necessary -27- This paper size is applicable to the Chinese National Standard (CNS) A4 specification (210X 297 gram) Ministry of Economic Affairs Central Bureau of Precinct Employee Consumer Cooperative Printing Α7 Β7 5. Description of the invention (25) and limit it to the maximum value (step 95). Step 96 averages the colors of the above four corners, and then Step 9 7 determines that X = 0, 2, 3, 4, 5, or 1 〇, that is, in the edge segment S0, S2, S3, S4, S54S1 () (edge segment If the extension will pass through the corner cu) whether there is any intersection position distance is obtained by the transparent polygon. If yes, the mixed color value is ignored (step 9 8) and set to 0 ”If no transparent polygon is involved, step 9 9 finds the blended tl color B,‘ when it becomes the last tb_blend_color value Btl. This process is repeated in step 90b to find the colors of the other three sampling points of this pixel, that is, to find the final mixed color values Btr, Bb, and Bbr for the upper right corner Ctr ', the lower left corner cbl, and the lower right corner cbr, respectively. Referring now to FIG. 5 e, the final color calculation processing of the color mixer 4 6-3 starts at step 9 2, in which the number of intersection positions where the four sides of the pixel (edge segment% ^, S6 and S8) are not covered is calculated. The edge count (must be zero or at least two) and transparency conditions are used in step 93. If there are 2 edge intersection positions and none of the four sampling corners are covered by transparent polygons (determined by the inspection identified by transparency), it is assumed that a single polygon edge passes through the current pixel: two areas must be calculated (the first polygon covers area A 1 Cover the area A2) with another polygon. This can be found in the consideration of Figures 8a-8f, which shows six possible situations of the position of the 2 edge intersection and the position: In Figure 8a, the edge 3 9 is nearly vertical and the edge segment s3 is cut into two parts (left The normalized length of the part is equal to, since the total length of the normalization of any pixel edge segment is 1, the normalized length of the right part (1-b)); the bottom edge segment $ 8 is cut into two parts (left part The normalized length of the copy ^ and the normalized length of the right part (1_U)-area AIrrO.VL + U and area A2 = 1-A1 (at -28- the paper size is applicable to the Chinese National Standard (CNS) A4 specification ( 21〇χ297mm) f Please read the precautions on the back before filling in this page} Binding · Order A7 B7 5. Description of the invention (26) In all cases), where the pixel color CP is determined by the following formula CP 〇.) (Ctl Color + Cbi color) * Al + 〇5 * (Ctr color + Cbr color in Figure 8b, edge 3 9 is close to horizontal and the left edge segment ~ is cut into two parts (B / known normalization length Is and, The normalized length of the bottom part (Bu Yi)), the right side 'Elephant Se is cut into two parts (the normalized length of the top part u and, the normalized length of the bottom 16 (1 _ I · 6))-region A 1 = 〇 · 5 (^ 5 +] _6), where the pixel color CP is CP-〇. "(Ctl color + Ctr color ) * A1 + 0 ”(Cbi color + Cbr color” A2. Similarly, in the case of FIG. 8 c, area A 1 = 0 · 3 (] _5 * L), pixel color _ CP = (CU color) * Al + l / 3 (Cbl color + Cbr color + Cu color) * A2. In the case of Figure 8d, a1 = 0 5 (1_i5) * l8, CP = (Cbi color) * Al + l / 3 (Ctl color + Cbr color + Ctr color) * Α2. In the case of Figure 8 e, A 1 = 0.5 (1-] _3) *] _6, CP = (Ctr color) * Al + l / 3 (Ctl color + Cbr color + Cbl color) * A2. Finally, for the situation in Figure 8 f, a 1 = 0.5 ((1-] _8) * (1-L)), CP = (Cbr color) * Al + l / 3 (Ctl Color + Cbl color + Ctr color) * A2. If there are no two edge intersections, or if the transparency flag is set at any of the four corner sampling points, the pixel is considered to have four separate areas A 1 'A 2, A 3 and A 4 and 4 cross position processing; must use the regional weighted good paper scale applicable to the Chinese national standard (CNS) Jing Shu (2 丨 os7mm (Please read the precautions on the back before filling in this page)-Packing. Order Printed by the Employee Consumer Cooperative of the Central Standards Bureau of the Ministry of Economic Affairs 29- 318923 A7 B7 5. Description of the invention (27) Step 95 of calculation. It is displayed graphically in Figure 8g; the calculated area is as follows: A 1 = 1/4 (lj + Is) Α2 = ι / 4 ((1 · [3) +] _ 6) Α3 = ι / 4 ((1-1.5 ) +18) Α4 = 1/4 ((146) + (148)) The final mixed pixel color CP data is: CP = (Ctl color) * Al + (Ctr color) * A2 + (Cbl color) * A3 + (Cbr color) * Α4. The mixed color C Ρ information of the pixel makes the final decision in step 9 4 or 9 5. This pixel color data signal is output to the display to be presented to the viewer. 7 〇3 Here is a detailed description of the decision pixel in the computer image generator Preferred embodiments of the apparatus and method of color content, many changes and modifications will be apparent to those who are accustomed to this. Therefore, we will only use the content of the attached patent application project to limit the scope and not use the specific tools and procedures explained here. n ^ — — ^ 1 ·-I- I-m Ϊ-m ^ i I— I mm-^ (please read the precautions on the back before filling this page) Printed by the Ministry of Economic Affairs Central Standards Bureau Unemployment Consumer Cooperative -30 -This paper scale is applicable to China National Standard (CNS) Α4 specification (210Χ 297mm)

Claims (1)

經濟部中央橾準局貝工消費合作社印製 A8 B8 C8 --------------D8 六、申請專利範® ' ' — i•一種因應電腦影像產生器的視頻資料訊號輸出來決定要 顯示的像素陣列的每一像素最後可見顏色的方法,包含 的步驟有: D (a) 首先接收描述所要顯示的至少一個多邊形表面的每 個的至少二個頂點的每.一個的一組顯示空間(I,】) 座標的輸入資料訊號,每對不同頂點定義相關多邊 形表面的不同邊緣: (b) 響應所收到的頂點資料訊號,產生描述沿著限制顯 示像素陣列的每個像素多個邊緣段中相關的一個與 每個多邊形表面邊緣的交叉位置的資料訊號,如果 有的話: (c) 以每一個像素爲基準,儲存形成該像素的所有多邊 形表面的邊緣段交又資料訊號’以及佔有該像素任 何邵份的每個多邊形表面的色彩資料; (d) 對每個要顯示的像素,處理所選定的多個相鄰像素 排列的多個不同邊緣段的儲存資料,以求得每個可 顯示像素的每個角落的色彩強度資料訊號:及 (e) 混合目前處理的像素的所有角落色彩強度資料訊號 ,以決定顯示像素的最後的可見顏色。 2. 根據申請專利範圍第1項中的方法,其中步驟(b)包括步 膝·使用一組四個像素月落中選定的角落當取樣點:在 決定自指定的一個像素角落延伸到相同像素的另一角落 的邊緣段的交叉位置資料。 · 3. 根據申請專利範圍第2項中的方法,其中步驟(c )進一 _____ .31 - 本紙铁尺度適用中關家標準(CNS ) A4·· ( 210X297公釐) ' ——裝------1T------二. (請先閲讀背面之注意事項再填寫本頁} A8 Βδ C8 D8 經濟部中央標準局員工消費合作,杜印製 申請專利範圍 步包括步驟:決定每個像素在透明與不透明間的一個透 明度値τ :對τ値指示透明的像素不儲存任何資料;増 加错存資料的角落取樣點的數目以響應透明度傻τ的増 加。 4. 根據申請專利範圍第3項中的方法,包括只有在該像素 的圪明度値Τ是-全不透明時,儲存所有四個像素角落 的資料的步驟。 5. 根據申請專利範圍第3項中的方法,進一步包括步驟: 對夕個Τ値範圍少於最大値的每一個,提供多個儲存資 料的像素角落的互補圖樣:並對任何多邊形表面選擇不 同的圖樣。 6. 根據申請專利範圍第5項中的方法,進一步包括對每個 具有Τ値位在預先選定的範圍内且與特定顯示像素相關 的夕邊形,隨機選擇一對圖樣中的一個圖樣步驟。 7·根據申請專利範圍第丨項中的方法,其中步驟包括選 擇和連接多對像素角落之至少一個邊緣段相鄰之像素的 排列步驟。 8_根據申請專利範圍第7項中的方法,包括了配置與處理 中像素相鄰的四個其他像素排列的步驟。 9·根據申請專利範圍第8項中的方法,進一步包括選擇處 理中像素緊臨其上,下,前與後像素其他排列的步驟。 瓜根據申請專利範圍第i項中的方法,其中多個多邊形表 面提供處理中像素的顏色,且進一步包括藉·著混合來自 復蓋該像素的任一個有效角落的所有多邊形的色彩濃度 ---------------ST------; i. (請先閔讀背面之注意事項再填寫本頁) 國家標準(CNS) -32- A4現格(2丨0x297公釐) 六 ABCD 鎚濟部中央榡準局員工消費合作社印裝 11.裉,來取得處理中像素的色彩的步驟。 彩利範圍第10項中的方法,進-步包括在色 來自二:前,響應特定多邊形的透明度,修正每個 12报復攻夕邊形的色彩濃度資料的步驟。 有:::專利範圍第"項中的方法,進—步包括將所 步緣。-區域小於—顯示像素區域的多逢形數位遽出的 13 申請專利範圍第丨項中的方法,其中步驟(b)進—步 値祛步驟··決定每個像素界於透明與不透明間的透明度 广響應透明度値T的變化.,改變儲存資料的角落取 友點數目。 根據申請專利範圍第13項中的方法,進一步包括步驟 :響應相關於該像素角落相關多邊形的透明度値的增加R ’如大邊緣交叉位置資料的量以將相關的邊緣交叉位置 由相關的像素角落移開。 15 •根據申請專利範圍第丨4項中的方法,進一步包括步骤 •若在所選定方向的邊緣交又距離大於取樣點間的距離 ’則將邊緣交又位置資料値限制在預先決定的極大値。 16·根據申請專利範圍第1 5項中的方法,其中顯示空間是 顯示器光柵,且包含步驟:對所選的諸像素角落,在第 —光橱方向修正邊緣交叉位置距離;對其餘像素角落, 在第二方向修正邊緣交叉位置距離,第二方向通常與第 一光柵方向成直角。 17.—種在電腦影像產生器(CIG)中顯示處理器的色彩強度 -33- 本纸張尺度適用中國國家標準(CNS > Α4規格(210X 297公釐) --------'1^------ΐτ------- ^ (請先閲讀背面之注意事項再填寫本頁) 經濟部中央標準局員工消費合作社印製 318923 as B8 C8 ______ D8 六、申請專利範圍 副組件,·包含: 邊緣遮段計算裝置,接收描述所要顯示的多個多邊形 表面的每一個的至少三個頂點的每一個的一組顯示空間 (I,J)座標的輸入資料訊號,以決定(a)每個順序系列的 可見顯示像素的哪個邊緣段,如果有的話,被由所收到 的每一對不同頂點資料訊號所定義的多邊形邊緣所穿過 ,及(b)沿著相關像素邊緣段的交叉位置; 框架緩衝器裝置,以每一個像素爲基準,儲存形成每 個像素的所有多邊形的邊緣交又資料訊號,以及佔有該 像素任何部份的每個多邊形表面的彩色資料;及 後處理器裝置,對每個要顯示的像素,由框架緩衝器 裝置接收描述多個相鄰像素排列的多個邊緣資料訊號, 以解析邊緣關係與混合多邊形色彩強度資料來決定顯示 裝置接收CIG的視頻資料輸出要顯示的每個像素的最後 而可見的彩色資料訊號。 根據申請專利範圍第1 7項中的副組件,其中該後處理 器裝置進一步接收描述每個提供目前像素總色彩的多邊 形的透明度値Τ的資料訊號,並因應所收到的τ値混合 色彩資訊訊號》 根據申請專利範圍第1 7項中的副组件,其中像素排列 包括相鄰於每個目前處理像素的四個額外像素。 2〇.根據申請專利範圍第I 9項中的副組件,其中的後處理 裝置包括:同時提供資料訊號給沿著多個顯.示器光柵邊 緣掃描線的角落資料暫存器裝置;保留暫存器裝置,接 n Ί ^ ~~ir------Γ^ (請先聞讀背面之注意事項再填寫本頁)A8 B8 C8 ------------- D8 printed by the Beigong Consumer Cooperative of the Central Bureau of Economic Affairs of the Ministry of Economic Affairs VI. Application for a patent ® '' — i • A video material in response to a computer image generator The method of signal output to determine the last visible color of each pixel of the pixel array to be displayed includes the following steps: D (a) First, receive each of at least two vertices describing each of at least one polygonal surface to be displayed A set of display space (I,) coordinates of the input data signal, each pair of different vertices defines different edges of the relevant polygon surface: (b) In response to the received vertex data signal, generates a description of each pixel array along the limit display The data signal of the intersection of the relevant edge of each edge segment of each pixel with the edge of each polygon surface, if any: (c) Based on each pixel, store the intersection of the edge segments of all polygon surfaces forming the pixel And the data signal 'and the color data of each polygonal surface occupying any part of the pixel; (d) For each pixel to be displayed, process the selected multiple phases The stored data of multiple different edge segments arranged adjacent pixels to obtain the color intensity data signal of each corner of each displayable pixel: and (e) mixing the color intensity data signals of all corners of the currently processed pixel to determine The last visible color of the display pixel. 2. According to the method in item 1 of the patent application scope, where step (b) includes step knees. • Use a set of four pixels in the selected corner of the moon as the sampling point: extend from the designated one pixel corner to the same pixel The intersection position information of the edge segment of the other corner. · 3. According to the method in item 2 of the scope of patent application, in which step (c) _____. 31-The iron standard of this paper is applicable to Zhongguanjia Standard (CNS) A4 ·· (210X297mm) '——Installed-- ---- 1T ------ 2. (Please read the precautions on the back before filling in this page) A8 Βδ C8 D8 Employee consumption cooperation of the Central Standards Bureau of the Ministry of Economy A transparency value τ between transparent and opaque for each pixel: does not store any data for τ value indicating transparent pixels; increase the number of corner sampling points of the wrongly stored data in response to the increase in transparency τ. 4. According to the scope of the patent application The method in item 3 includes the step of storing the data of all four pixel corners only when the brightness value of the pixel is totally opaque. 5. According to the method in item 3 of the patent application scope, the method further includes steps : For each of the T values whose range is less than the maximum value, provide a complementary pattern of multiple pixel corners for storing data: select a different pattern for any polygonal surface. 6. According to item 5 of the patent application scope The method further includes the step of randomly selecting one of a pair of patterns for each evening shape with a T value within a pre-selected range and associated with a specific display pixel. 7. According to item 丨The method in which the steps include the step of selecting and connecting pixels adjacent to at least one edge segment of multiple pairs of pixel corners. 8_According to the method in item 7 of the scope of the patent application, including the configuration of four adjacent pixels in the process Steps for arranging other pixels 9. According to the method in item 8 of the patent application scope, it further includes the step of selecting other arrangements of pixels immediately above, below, before and after pixels in the process. Gua according to item i of the patent application scope Method, where multiple polygonal surfaces provide the color of the pixel in processing, and further include by mixing the color density of all polygons from any effective corner covering the pixel ------------ --- ST ------; i. (Please read the precautions on the back and then fill in this page) National Standard (CNS) -32- A4 present (2 丨 0x297mm) Six ABCD Hammer Department The Central Bureau of Precinct Employee Consumer Cooperative printed 11.11 to obtain the color of the pixel under processing. The method in Item 10 of the color profit range, further includes responding to the transparency of a specific polygon before the color comes from 2: Steps for correcting the color density data of the twelve-sided revenge for each twelve revenge. There are :: The method in the " item of the patent scope, further including the margin of the step. The method of item 13 in the patent application scope, which is formed by the shape and number, in which step (b) advances to step-by-step removal step. Determines the transparency of each pixel between transparent and opaque, and responds to changes in transparency value T., Change the number of friends in the corner where the data is stored. According to the method in item 13 of the patent application scope, it further includes the step of: in response to an increase in the transparency value of the relevant polygon related to the corner of the pixel, such as the amount of large edge intersection position data, to shift the relevant edge intersection position from the relevant pixel corner Move away. 15 • According to the method in item 丨 4 of the patent application scope, further including the steps • If the distance of the edge intersection in the selected direction is greater than the distance between the sampling points', limit the value of the edge intersection position data to a predetermined maximum value . 16. According to the method in item 15 of the patent application scope, in which the display space is a display grating and includes the steps of: correcting the distance of the edge crossing position in the direction of the first optical cabinet for the selected pixel corners; for the remaining pixel corners, The distance of the edge crossing position is corrected in the second direction, which is usually at right angles to the first raster direction. 17.—The color intensity of the display processor in the computer image generator (CIG) -33- This paper scale is applicable to the Chinese National Standard (CNS> Α4 specification (210X 297 mm) -------- '1 ^ ------ Ιτ ------- ^ (Please read the notes on the back before filling out this page) Printed by the Staff Consumer Cooperative of the Central Standards Bureau of the Ministry of Economic Affairs 318923 as B8 C8 ______ D8 VI. Application The sub-components of the patent scope include: an edge-occlusion segment computing device that receives an input data signal describing a set of display space (I, J) coordinates of each of at least three vertices of each of a plurality of polygonal surfaces to be displayed, To determine (a) which edge segment of the visible display pixels of each sequential series, if any, is crossed by the polygon edge defined by each pair of different vertex data signals received, and (b) along The intersection position of the relevant pixel edge segment; The frame buffer device, based on each pixel, stores the edge intersection data signals of all polygons forming each pixel, and the color of each polygon surface occupying any part of the pixel data And the post-processor device, for each pixel to be displayed, the frame buffer device receives a plurality of edge data signals describing the arrangement of a plurality of adjacent pixels, to analyze the edge relationship and the mixed polygon color intensity data to determine the display device to receive The CIG's video data outputs the last and visible color data signal of each pixel to be displayed. According to the sub-component in item 17 of the patent application scope, the post-processor device further receives a The data signal of the transparency value of the polygon and corresponding to the received τ-value mixed color information signal. According to the sub-component in item 17 of the patent application, the pixel arrangement includes four adjacent to each currently processed pixel Extra pixels. 2〇. According to the sub-component in the patent application scope item I9, the post-processing device includes: simultaneously providing data signals to the corner data register device along the scanning lines of the raster edge of multiple displays. ; Retain the register device, connect n Ί ^ ~~ ir ------ Γ ^ (please read the precautions on the back before filling this page) A8 B8 C8 D8 申請專利範圍 收每個邊緣#描線資料訊號,以同時提供資料訊號給沿 著多條邊緣掃描線的每一條上的多個角落;及邊緣段計 算裝置,連接到暫存器裝置,以決定沿著多條像素邊緣 排列的每一條上的交又位置長度。 (请先S饋背痴Μ法意事項真填务本\20 —裝· 經濟部中央標準局員工消費合作社印製 -35 本紙張尺度適用中國國家標準(CNS ) Α4規格(210Χ297公釐)A8 B8 C8 D8 patent application scope to receive each edge # line data signal to provide data signals to multiple corners on each of the multiple edge scan lines at the same time; and edge segment computing device connected to the register device To determine the length of the intersection and position on each of the multiple pixels arranged along the edge of the pixel. (Please first fill in this true copy of the legal matters of interest \ 20-Packed · Printed by the Employee Consumer Cooperative of the Central Standards Bureau of the Ministry of Economic Affairs -35 This paper standard is applicable to the Chinese National Standard (CNS) Α4 specification (210Χ297 mm)
TW85114371A 1994-08-19 1996-11-21 TW318923B (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US08/292,209 US5668940A (en) 1994-08-19 1994-08-19 Method and apparatus for anti-aliasing polygon edges in a computer imaging system

Publications (1)

Publication Number Publication Date
TW318923B true TW318923B (en) 1997-11-01

Family

ID=51566933

Family Applications (1)

Application Number Title Priority Date Filing Date
TW85114371A TW318923B (en) 1994-08-19 1996-11-21

Country Status (1)

Country Link
TW (1) TW318923B (en)

Similar Documents

Publication Publication Date Title
US5668940A (en) Method and apparatus for anti-aliasing polygon edges in a computer imaging system
US5325472A (en) Image displaying system for interactively changing the positions of a view vector and a viewpoint in a 3-dimensional space
US6590573B1 (en) Interactive computer system for creating three-dimensional image information and for converting two-dimensional image information for three-dimensional display systems
US5689287A (en) Context-preserving display system using a perspective sheet
JPS63502464A (en) Comprehensive distortion correction in real-time image generation systems
JPS62151896A (en) Edge smoothing for calculator image generation system
Tatzgern et al. Exploring real world points of interest: Design and evaluation of object-centric exploration techniques for augmented reality
WO2003034342A1 (en) Digital image magnification for internet appliance
WO2018080542A1 (en) Developing a non-rectangular user interface
CN107168534B (en) Rendering optimization method and projection method based on CAVE system
GB2256568A (en) Image generation system for 3-d simulations
CN114445525A (en) Virtual object display method and device and electronic equipment
Blundell Enhanced visualization: Making space for 3-D images
TW318923B (en)
US20190051058A1 (en) 3d immersive visualization of a radial array
JP2020528626A (en) How to overlay web pages on 3D objects, devices and computer programs
Andreev et al. Stereo Presentations Problems of Textual information on an Autostereoscopic Monitor
JP4624617B2 (en) Improved S-buffer anti-aliasing method
Krebs Basics cad
Negroponte The computer simulation of perception during motion in the urban environment.
JP4125789B2 (en) Method and apparatus for anti-aliasing polygon edges in a computer imaging system
KR940002331B1 (en) Character drawing method
Hertzmann Toward a Theory of Perspective Perception in Pictures
Zheng et al. Interactive Design and Optics-Based Visualization of Arbitrary Non-Euclidean Kaleidoscopic Orbifolds
JP3098060B2 (en) Simulated view signal generator

Legal Events

Date Code Title Description
MM4A Annulment or lapse of patent due to non-payment of fees