In classification of binary featured data, distance computation is carried out by considering each feature. We represent the given binary data as run-length encoded data. This would lead to a compact or compressed representation of data. Further, we propose an algorithm to directly compute the Manha
A posteriori scaling of run length encoded polygons
β Scribed by Ph. Coueignoux
- Publisher
- Elsevier Science
- Year
- 1981
- Weight
- 254 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0146-664X
No coin nor oath required. For personal study only.
β¦ Synopsis
Scaling run-length encoded binary patterns is quite useful in some instances of computer graphics, such as phototypesetting with variable-sized characters. A very simple method can be used to perform the scaling, which separates scaling along the direction of the runs and along the perpendicular. This method, herein called a posteriori scaling, has the drawback of adding noise to the original pattern. After reviewing the method itself, we derive several mathematical results to better understand known characteristics of the noise, taking polygons as test patterns.
π SIMILAR VOLUMES
Let X and Y be two run-length encoded strings, of encoded lengths k and l, respectively. We present a simple O(|X|l + |Y |k) time algorithm that computes their edit distance.
Template-based volume rendering is a technique to accelerate volume ray casting. It does not trade off image quality for rendering speed. However, it still falls short of interactive manipulation of volume data, mainly owing to the ray-by-ray volume access pattern and the long ray path in the transp
A complete set of constraints is proposed to force a high Reynolds number turbulence model to correctly predict the behaviour of the outer part of the boundary layer, whatever the pressure gradient and the Reynolds number. The constraints are general and are presently applied to a two-equation model
Numerous estimates of economies of scale in the hospital setting have been obtained since the early 1980s from both flexible long-run and short-run cost functions. Although the theoretical superiority of the latter approach is widely recognized, it has been previously suggested that the two cost spe