发明名称 Path to trapezoid decomposition of polygons for printing files in a page description language
摘要 This invention cures many inefficiencies with known scan conversion methods. This invention employs a edge array rather than a set linked list from an array of pointers equal in number to the number of scan lines. This invention thus eliminates storage of linked list pointers which in the prior art included many null pointers resulting in better memory utilization. es on-chip memory when employing a single chip microprocessor. This invention sorts the active edge table only at edge intersections and vertices, thus eliminating much unneeded sorting. This invention permits integrated clipping of a subject polygon by a clip polygon and forming trapezoids filling the clipped area by activating trapezoid formation at every vertex of either polygon and at every edge intersection. This process saves code space and computer processing time. This invention efficiently utilizes the resources of a multiprocessor integrated circuit by spawning of subtasks from a RISC type processor to one or more DSP type processors.
申请公布号 US2004160627(A1) 申请公布日期 2004.08.19
申请号 US20030749050 申请日期 2003.12.30
申请人 GUPTA SADHANA;KUMAR SUVARNA HARISH;EASWAR VENKAT V.;GHOSE ARUNABHA 发明人 GUPTA SADHANA;KUMAR SUVARNA HARISH;EASWAR VENKAT V.;GHOSE ARUNABHA
分类号 G06F15/00;G06K15/00;G06T11/40;G09G5/00;(IPC1-7):G06F15/00 主分类号 G06F15/00
代理机构 代理人
主权项
地址