This paper presents an efficient approach to, and the advantages of, traversing a uniformly subdivided space pierced by a line segment. A voxel, as the basis constituent element of a uniformly subdivided space, is restricted to the form of a cube. The algorithm works in two steps. In the first step, the so-called Bresenham voxels are identified and, by comparing their position codes, their type of connectivity is determinated. To achieve the required connectivity between neighbouring voxels, the second step of the algorithm is applied to find the missing voxels. In this way, the algorithm efficiently switches between face-, edge- and vertex-connectivity. Although the algorithm works with floating-point precision, in computational terms, it is extremely efficient

Rights

URN

URN:NBN:SI:DOC-63L70KPJ

COBISSID

19489541

Added

05.07.2022

Metadata

Citation

APA:

Čapelnik, Sergej, Žalik, Borut (1998). Hitro iskanje geometrijskih podatkov. Geodetski vestnik, volume 42, issue 3, str. 269-276. URN:NBN:SI:DOC-63L70KPJ from http://www.dlib.si

MLA:

Čapelnik, Sergej, Žalik, Borut. "Hitro iskanje geometrijskih podatkov." Geodetski vestnik volume 42. issue 3 (1998) str. 269-276.
<http://www.dlib.si/?URN=URN:NBN:SI:DOC-63L70KPJ>

Geodetski vestnik
2000-
(Assembly record)