公开(公告)号：EP0862136A2

公开(公告)日：1998-09-02

申请号：EP98301056.2

申请日：1998-02-13

申请人： Adobe Systems, Inc.

发明人： Yhann, Stephan

IPC分类号： G06T5/00

CPC分类号： H04N1/58 ,  G06T7/12

摘要： A vector map representation of page information to perform trapping. The vector map representation combines the positive attributes of both raster and vector based representations to make trapping more efficient by combining the sparseness of the vector representation and the constant unit complexity of the raster representation. In the preferred embodiment of the invention, a page is defined by tiles, and each tile is mapped to a 2-D array of edge pointers referred to as the vector map. Each cell in the vector map contains a list of all of the edges of the image that pass through it. A pair of edges can only interact if they are in the same vector map cell list. Thus, edge intersection and color finding tests are localized as with raster based trapping while the data sparseness of vector based trapping is retained. For a suitably chosen vector map size, a single edge generally does not intersect many cells. A trapping function is applied to edges as determined from the vector map.

摘要翻译： 用于执行陷印的页面信息的矢量图表示。 矢量地图表示结合了基于光栅和矢量的表示的正性属性，通过组合矢量表示的稀疏度和光栅表示的恒定单位复杂度来使捕获更有效。 在本发明的优选实施例中，页面由瓦片定义，并且每个瓦片被映射到被称为向量图的边缘指针的2-D阵列。 矢量图中的每个单元格包含通过它的图像的所有边缘的列表。 如果它们在相同的向量图单元格列表中，则一对边缘只能进行交互。 因此，边缘交叉和颜色检测测试与基于光栅的捕获一样定位，同时保留基于向量的捕获的数据稀疏性。 对于适当选择的矢量地图大小，单个边缘通常不相交许多单元格。 捕获函数应用于从矢量图确定的边。

公开(公告)号：EP0862136B1

公开(公告)日：2004-09-08

申请号：EP98301056.2

申请日：1998-02-13

申请人： Adobe Systems, Inc.

发明人： Yhann, Stephan

IPC分类号： G06T5/00 ,  H04N1/58

CPC分类号： H04N1/58 ,  G06T7/12

公开(公告)号：EP0862136A3

公开(公告)日：2000-01-19

申请号：EP98301056.2

申请日：1998-02-13

申请人： Adobe Systems, Inc.

发明人： Yhann, Stephan

IPC分类号： G06T5/00 ,  H04N1/58

CPC分类号： H04N1/58 ,  G06T7/12

摘要： A vector map representation of page information to perform trapping. The vector map representation combines the positive attributes of both raster and vector based representations to make trapping more efficient by combining the sparseness of the vector representation and the constant unit complexity of the raster representation. In the preferred embodiment of the invention, a page is defined by tiles, and each tile is mapped to a 2-D array of edge pointers referred to as the vector map. Each cell in the vector map contains a list of all of the edges of the image that pass through it. A pair of edges can only interact if they are in the same vector map cell list. Thus, edge intersection and color finding tests are localized as with raster based trapping while the data sparseness of vector based trapping is retained. For a suitably chosen vector map size, a single edge generally does not intersect many cells. A trapping function is applied to edges as determined from the vector map.