Add to ORKGThe usual method for specifying a fill pattern is to give a small sample of the pattern in raster form. A plotting routine then repeats this pattern over an arbitrary region. It is difficult for devices such as pen plotters to accurately reproduce pictures specified in this manner. By converting the original fill pattern to vector form, it is possible to fill arbitrary polygonal regions with a good approximation of most raster patterns
The paper presents a very straightforward and effective algorithm to convert a space partitioning, m...
Recent advances in scanning technology have made it possible for linework to be scanned on relativel...
We address the problem of representing captured images in the continuous mathematical space more usu...
This thesis describes Polygon Filling System, an interactive graphics system, which fills user defin...
A uniform and consistent way of filling degenerated shapes on a raster grid is presented. The proces...
This paper presents fill algorithms for boundary-defined regions in raster graphics. The algorithms ...
The application of vectorization algorithms to digital images derived from natural scenes is discuss...
This paper presents fill algorithms for boundary-defined regions in raster graphics. The algorithms ...
Raster clip-art images, which consist of distinctly colored regions separated by sharp boundaries ty...
This thesis describes and compares several methods for producing bilevel patterns to simulate grey l...
[[abstract]]Region filling is a fundamental operation in computer graphics and image processing. The...
http://artis.imag.fr/Publications/2008/EWHS08/International audienceWe describe a rendering system t...
This report explores ways to render specific components of an R plot in raster format, when the ove...
<p>The paper presents a very straightforward and effective algorithm to convert a space partitioning...
In this thesis we show that a combination of raster- and vector-representations of the geometric inf...
The paper presents a very straightforward and effective algorithm to convert a space partitioning, m...
Recent advances in scanning technology have made it possible for linework to be scanned on relativel...
We address the problem of representing captured images in the continuous mathematical space more usu...
This thesis describes Polygon Filling System, an interactive graphics system, which fills user defin...
A uniform and consistent way of filling degenerated shapes on a raster grid is presented. The proces...
This paper presents fill algorithms for boundary-defined regions in raster graphics. The algorithms ...
The application of vectorization algorithms to digital images derived from natural scenes is discuss...
This paper presents fill algorithms for boundary-defined regions in raster graphics. The algorithms ...
Raster clip-art images, which consist of distinctly colored regions separated by sharp boundaries ty...
This thesis describes and compares several methods for producing bilevel patterns to simulate grey l...
[[abstract]]Region filling is a fundamental operation in computer graphics and image processing. The...
http://artis.imag.fr/Publications/2008/EWHS08/International audienceWe describe a rendering system t...
This report explores ways to render specific components of an R plot in raster format, when the ove...
<p>The paper presents a very straightforward and effective algorithm to convert a space partitioning...
In this thesis we show that a combination of raster- and vector-representations of the geometric inf...
The paper presents a very straightforward and effective algorithm to convert a space partitioning, m...
Recent advances in scanning technology have made it possible for linework to be scanned on relativel...
We address the problem of representing captured images in the continuous mathematical space more usu...