We propose an optimized scanline filling algorithm for OpenVG two-dimensional vector graphics. For each scanline of a path, it adaptively selects a left or right scanning direction that minimizes the number of pixels visited during scanning. According to the experimental results, the proposed algorithm reduces the number of pixels visited by 6 to 37% relative to that with a constant scanning direction for all the scanlines.
Area filling or polygon filling is a fundamental operation in computer graphics. There are many meth...
A study is conducted on the adaptive constrained mesh generation for two-dimensional finite element ...
The research domain of Multimedia Content Analysis (MMCA) considers all aspects of the automated ext...
Abstract — An optimized rendering algorithm of the OpenVG 2D vector graphics for hardware implementa...
An optimized rendering algorithm of the OpenVG 2D vector graphics for hardware implementation is pr...
This thesis describes methods used for filling closed areas in 2D. This text describes the most freq...
This paper describes an OpenVG-compliant hardware rasterizer with configurable anti-aliasing and mu...
This paper presents fill algorithms for boundary-defined regions in raster graphics. The algorithms ...
This paper presents fill algorithms for boundary-defined regions in raster graphics. The algorithms ...
Visualization of large vector line data is a core task in geographic and cartographic systems. Vecto...
This paper presents a new approach for the voxelization of volumetric scene graphs. The algorithm ge...
This paper presents a scan line algorithm for drawing picture of parametrically defined surfaces. A ...
This paper proposes and implements a new solution for generating progressive vector lines and polygo...
OpenVG is a new open standard for 2 dimensions vector graphics for handheld devices. This project, w...
Recent advances in graphics architecture focus on improving texture performance and pixel processing...
Area filling or polygon filling is a fundamental operation in computer graphics. There are many meth...
A study is conducted on the adaptive constrained mesh generation for two-dimensional finite element ...
The research domain of Multimedia Content Analysis (MMCA) considers all aspects of the automated ext...
Abstract — An optimized rendering algorithm of the OpenVG 2D vector graphics for hardware implementa...
An optimized rendering algorithm of the OpenVG 2D vector graphics for hardware implementation is pr...
This thesis describes methods used for filling closed areas in 2D. This text describes the most freq...
This paper describes an OpenVG-compliant hardware rasterizer with configurable anti-aliasing and mu...
This paper presents fill algorithms for boundary-defined regions in raster graphics. The algorithms ...
This paper presents fill algorithms for boundary-defined regions in raster graphics. The algorithms ...
Visualization of large vector line data is a core task in geographic and cartographic systems. Vecto...
This paper presents a new approach for the voxelization of volumetric scene graphs. The algorithm ge...
This paper presents a scan line algorithm for drawing picture of parametrically defined surfaces. A ...
This paper proposes and implements a new solution for generating progressive vector lines and polygo...
OpenVG is a new open standard for 2 dimensions vector graphics for handheld devices. This project, w...
Recent advances in graphics architecture focus on improving texture performance and pixel processing...
Area filling or polygon filling is a fundamental operation in computer graphics. There are many meth...
A study is conducted on the adaptive constrained mesh generation for two-dimensional finite element ...
The research domain of Multimedia Content Analysis (MMCA) considers all aspects of the automated ext...