1990
DOI: 10.1063/1.168381
|View full text |Cite
|
Sign up to set email alerts
|

A comparison of line integral algorithms

Abstract: Integrals along lines passing through arrays of integer data are used in many applications. Existing algorithms employ parametric methods and floating point calculations to determine the data values that contribute to the line integrals, along with some form of interpolation to weight these data values. A new, nonparametric integer-arithmetic noninterpolating algorithm (NI0) and an extension using first-order interpolation (NI1) are presented here. These algorithms are compared for accuracy and speed with both… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

1992
1992
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(8 citation statements)
references
References 0 publications
0
7
0
Order By: Relevance
“…Nevertheless, 18-connected and 26-connected lines are used in graphics for ray tracing. The reason is that the latter contain fewer voxels by a mean factor of 2, which implies a faster algorithm for computing lines [6][7][8][12][13][14]. Some algorithms can even switch between connectivities in order to achieve maximum precision with minimum computation time.…”
Section: Connectivity Of the Discrete Linementioning
confidence: 99%
See 1 more Smart Citation
“…Nevertheless, 18-connected and 26-connected lines are used in graphics for ray tracing. The reason is that the latter contain fewer voxels by a mean factor of 2, which implies a faster algorithm for computing lines [6][7][8][12][13][14]. Some algorithms can even switch between connectivities in order to achieve maximum precision with minimum computation time.…”
Section: Connectivity Of the Discrete Linementioning
confidence: 99%
“…However, the definition of this function is not unique and the choice of voxels representing the line is flexible, depending on the connectivity between them. A discrete line is said to have the containment property if it contains all voxels pierced by the continuous line [13]. A voxel of the 3-D discrete space shares 6 faces with the adjacent voxels, 12 edges, and 8 corners.…”
Section: Connectivity Of the Discrete Linementioning
confidence: 99%
“…To remedy these issues, this paper advocates approximating the integral in (4) as a line integral of a piecewise constant approximation of l. The resulting approximation is continuous, can be used with large grid point spacing, and can be computed with complexity only O(Q 0 ) for a Q 0 × Q 0 × Q 0 grid. This technique, commonly used in other disciplines (see references in [43]), involves splitting the 3D space into voxels centered at the grid points X := {x X 1 , . .…”
Section: B Radio Tomographic Modelsmentioning
confidence: 99%
“…Instead, this work proposes adopting a different approximation to the integral in (4). The technique, commonly used in other disciplines (see references in [23]) and hinted in a different context in [21], involves splitting the 3D space in voxels centered at the grid points X := {x X 1 , . .…”
Section: An Algorithm For Air-to-ground Radio Tomographymentioning
confidence: 99%