✦ LIBER ✦

Template-based rendering of run-length- encoded volumes

✍ Scribed by Lee, Cheol-Hi ;Koo, Yun-Mo ;Shin, Yeong Gil

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 206 KB
Volume: 9
Category: Article
ISSN: 1049-8907
DOI: 10.1002/(sici)1099-1778(199807/09)9:3<145::aid-vis185>3.0.co;2-q

No coin nor oath required. For personal study only.

✦ Synopsis

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 transparent regions. In this paper we present an object-order template-based volume rendering method that uses run-length encoding to enable skipping highly transparent regions. We present three algorithms, one for each principal axis direction. By combining the advantages of objectorder volume traversal and run-length encoded volumes, the algorithms achieve high quality rendering in a much shorter time than the original template-based volume rendering.

📜 SIMILAR VOLUMES

Classification of run-length encoded bin

Classification of run-length encoded binary data

✍ T. Ravindra Babu; M. Narasimha Murty; V.K. Agrawal 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 152 KB

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

Edit distance of run-length encoded stri

Edit distance of run-length encoded strings

✍ Ora Arbell; Gad M. Landau; Joseph S.B. Mitchell 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 745 KB

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.

Object-order template-based approach for

Object-order template-based approach for stereoscopic volume rendering

✍ Koo, Yun-Mo ;Lee, Cheol-Hi ;Shin, Yeong-Gil 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 663 KB

Stereoscopic volume rendering provides powerful depth information, but it takes a long time to render two-eye images. Previous algorithms based on reprojection methods project the result of one view of a stereo pair into the other instead of rendering a new one completely. Because of inaccurate mapp

A posteriori scaling of run length encod

A posteriori scaling of run length encoded polygons

✍ Ph. Coueignoux 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 254 KB

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. Th

Non-parametric randomness tests based on

Non-parametric randomness tests based on success runs of fixed length

✍ M.V. Koutras; V.A. Alexandrou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 552 KB

Let X,, be a random variable enumerating the number of appearances of a specific pattern in a sequence of n Bernoulli trials. A new method is presented for obtaining the conditional distribution of X, given the number of successes in the n trials. The method is applied to three fixed-length run stat

A run-length-coding-based approach to st

A run-length-coding-based approach to stroke extraction of Chinese characters

✍ Kuo-Chin Fan; Wei-Hsien Wu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 572 KB

Traditional stroke extraction approach usually adopts thinning technique as the preprocessing method in obtaining the skeletons of Chinese characters. However, thinning may produce spurious branches and multiple fork points at junctions. Such distortion will make stroke extraction process more compl