Best approximate circles on integer grids
ACM Transactions on Graphics (TOG)
ARTSccelerated ray-tracing system
IEEE Computer Graphics and Applications
A comparison of line integral algorithms
Computers in Physics
Fundamentals of surface voxelization
Graphical Models and Image Processing
Curve-drawing algorithms for Raster displays
ACM Transactions on Graphics (TOG)
3D scan-conversion algorithms for voxel-based graphics
I3D '86 Proceedings of the 1986 workshop on Interactive 3D graphics
IEEE Computer Graphics and Applications
IEEE Computer Graphics and Applications
Computer
A visibility determination algorithm for interactive virtual endoscopy
Proceedings of the conference on Visualization '00
Fast volumetric CSG modeling using standard graphics system
Proceedings of the seventh ACM symposium on Solid modeling and applications
Segmentation and Length Estimation of 3D Discrete Curves
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Segmentation and length estimation of 3D discrete curves
Digital and image geometry
Discrete linear objects in dimension n: the standard model
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
The supercover of an m-flat is a discrete analytical object
Theoretical Computer Science
Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension
Discrete Applied Mathematics
Offset Approach to Defining 3D Digital Lines
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Minimal offsets that guarantee maximal or minimal connectivity of digital curves in nD
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Novel geometrical voxelization approach with application to streamlines
Journal of Computer Science and Technology
GPU-based fast volumetric terrain modeling for volumetric GIS
Proceedings of the 2nd International Conference on Computing for Geospatial Research & Applications
Argo vehicle simulation of motion driven 3D LIDAR detection and environment awareness
AIS'11 Proceedings of the Second international conference on Autonomous and intelligent systems
The number of gaps in binary pictures
ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
Error-Bounded solid voxelization for polygonal model based on heuristic seed filling
ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
Characterization of the closest discrete approximation of a line in the 3-dimensional space
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I
Combinatorial relations for digital pictures
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Connectedness of offset digitizations in higher dimensions
CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
Counting gaps in binary pictures
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Robust generation of signed distance fields from triangle meshes
VG'05 Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume Graphics
A topological approach to voxelization
EGSR '13 Proceedings of the Eurographics Symposium on Rendering
| Hi-index | 0.00 |
A line voxelization algorithm generates from a 3D continuous line a 3D discrete line, which is a set of connected voxels approximating the continuous line. The connectivity of this set is a predefined attribute that specifies the way consecutive voxels are related along the line and determines the final shape and penetration property of the discrete line. This article investigates these properties and the accuracy-speed tradeoff for various connectivity classes. It presents a new algorithm, called the Tripod algorithm, which generates an exact 3D discrete line. For ray tracing/casting applications, it can adaptively alternate between connectivities, and it enjoys the advantages of the different connectivities with no cost penalty.