-
1.发明授权Path to trapezoid decomposition of polygons for printing files in a page description language 有权用于以页面描述语言打印文件的多边形梯形分解的路径公开(公告)号：US06693719B1
公开(公告)日：2004-02-17
申请号：US09397540
申请日：1999-09-16
IPC分类号： G06K1500
CPC分类号： G06T11/40
摘要： This invention cures many inefficiencies with known scan conversion methods. This invention employs an 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. 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.
摘要翻译： 本发明通过已知的扫描转换方法固化许多低效率。 本发明采用边缘阵列而不是来自与扫描线数量相等的指针阵列的设置链表。 因此，本发明消除了链接列表指针的存储，其在现有技术中包括许多空指针，导致更好的存储器利用。 本发明仅在边缘交叉点和顶点处分割活动边缘表，从而消除了不必要的分类。 本发明允许通过剪辑多边形对对象多边形进行集成剪裁，并且通过激活在任一多边形的每个顶点处和每个边缘交点处的梯形形成来填充剪切区域的梯形。 此过程可节省代码空间和计算机处理时间。 本发明通过将子任务从RISC型处理器产生到一个或多个DSP类型处理器来有效地利用多处理器集成电路的资源。
-
2.发明授权公开(公告)号：US06567182B1
公开(公告)日：2003-05-20
申请号：US09397539
申请日：1999-09-16
IPC分类号： G06M1500
CPC分类号： G06T11/40
摘要： 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.
摘要翻译： 本发明通过已知的扫描转换方法固化许多低效率。 本发明采用边缘阵列而不是来自与扫描线数量相等的指针阵列的设置链表。 因此，本发明消除了链接列表指针的存储，其在现有技术中包括许多空指针，导致更好的存储器利用。 采用单芯片微处理器时的片上存储器。 本发明仅在边缘交叉点和顶点处分割活动边缘表，从而消除了不必要的分类。 本发明允许通过剪辑多边形对对象多边形进行集成剪裁，并且通过激活在任一多边形的每个顶点处和每个边缘交点处的梯形形成来填充剪切区域的梯形。 此过程可节省代码空间和计算机处理时间。 本发明通过将子任务从RISC型处理器产生到一个或多个DSP类型处理器来有效地利用多处理器集成电路的资源。
-
3.发明授权Path to trapezoid decomposition of polygons for printing files in a page description language 有权用于以页面描述语言打印文件的多边形梯形分解的路径公开(公告)号：US07173727B2
公开(公告)日：2007-02-06
申请号：US10749050
申请日：2003-12-30
CPC分类号： G06T11/40
摘要： A computer implemented method of rasterizing a page in a page description language 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. The RISC type processor interprets the page in the page description language and detects a Y coordinate of edge intersection using the floating point calculation unit. The DSP type processors sort polygon edges in increasing Y coordinate and detect a Y coordinate of edge intersections via successive midpoint approximation using an integer multiplier unit.
摘要翻译： 以页面描述语言光栅化页面的计算机实现方法通过从RISC型处理器产生子任务到一个或多个DSP类型处理器来有效地利用多处理器集成电路的资源。 RISC类型处理器以页面描述语言解释页面，并使用浮点计算单元检测边缘交点的Y坐标。 DSP类型处理器以增加的Y坐标对多边形边缘进行排序，并使用整数乘法器单元通过连续中点近似来检测边缘交点的Y坐标。
-
4.发明授权Clipping and trapezoid decomposition of polygons for printing files in a page description language 有权用于打印文件的页面描述语言中的多边形的剪切和梯形分解公开(公告)号：US06288724B1
公开(公告)日：2001-09-11
申请号：US09397172
申请日：1999-09-16
IPC分类号： G06T1530
CPC分类号： G06T11/40 , G06K2215/0045
摘要： 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.
摘要翻译： 本发明通过已知的扫描转换方法固化许多低效率。 本发明采用边缘阵列而不是来自与扫描线数量相等的指针阵列的设置链表。 因此，本发明消除了链接列表指针的存储，其在现有技术中包括许多空指针，导致更好的存储器利用。 采用单芯片微处理器时的片上存储器。 本发明仅在边缘交叉点和顶点处分割活动边缘表，从而消除了不必要的分类。 本发明允许通过剪辑多边形对对象多边形进行集成剪裁，并且通过激活在任一多边形的每个顶点处和每个边缘交点处的梯形形成来填充剪切区域的梯形。 此过程可节省代码空间和计算机处理时间。 本发明通过将子任务从RISC型处理器产生到一个或多个DSP类型处理器来有效地利用多处理器集成电路的资源。
-
5.发明授权Method and apparatus for efficient caching and rendering of large patterns in a small memory printer 有权用于在小型存储打印机中高效缓存和呈现大图案的方法和装置公开(公告)号：US07133158B2
公开(公告)日：2006-11-07
申请号：US10259551
申请日：2002-09-27
申请人： Arunabha Ghose , Ralph E. Payne , Venkat V. Easwar
发明人： Arunabha Ghose , Ralph E. Payne , Venkat V. Easwar
CPC分类号： G06K15/02 , G06K15/1828
摘要： A method of performing a pattern fill operation of a pattern into a clipping region resolves the pattern into an intermediate format between a page description language and a page bit map. This intermediate format is cached. For each tiling of the pattern into the clipping region the pattern is clipped to the clipping region and rendered from the clipped intermediate format pattern into a corresponding location of a page bit map. The intermediate format of the pattern may be scan line runs and trapezoid fills. The intermediate format of the pattern may be paths and curves. The clipping of the pattern to the clipping region performs scan line conversion with polygon to polygon clipping or trapezoid/run array to trapezoid/run array clipping.
摘要翻译： 将模式的图案填充操作执行到裁剪区域的方法将图案解析为页面描述语言和页面位图之间的中间格式。 这个中间格式被缓存。 对于每个将图案拼贴到剪辑区域中，图案被剪裁到剪切区域并且从剪切的中间格式模式渲染到页面位图的对应位置。 模式的中间格式可以是扫描线运行和梯形填充。 图案的中间格式可以是路径和曲线。 剪切区域的剪切将通过多边形到多边形裁剪或梯形/运行数组进行扫描线转换，以梯形/运行数组削波。
-
6.发明授权公开(公告)号：US06532016B1
公开(公告)日：2003-03-11
申请号：US08956402
申请日：1997-10-23
IPC分类号： G06F1516
CPC分类号： G06K15/02 , G06K15/1851 , G06K15/1857
摘要： A method of processing print data allowing for rendering bands of print data in parallel. A main processor (52) of a single-chip multiprocessor converts an incoming page of print data into paths. The paths are then converted to primitives and the primitives are rasterized using parallel processor (60, 62, 64, 66). The parallel processors (60, 62, 64, 66) work in concert with the main processor (52) such that bands of the final print image are rendered into a frame buffer (58) in parallel, allowing for faster and more efficient processing of print data.
-
-
-
-
-
搜索结果
6 条记录 (耗时 0.021 秒)
