Generalizing Midpoint Algorithm to 3D Straight-Line
Wang Run-yun
Abstract
Wang Run-yun
Abstract
A 3D line segment can be defined with two endpoints, in which Δx≥Δy≥Δz0 , and then Midpoint 2D line algorithm is applied to the projections of line segment on xy and xz coordinate planes respectively, this results in the Midpoint algorithm for 3D straight-line. Case studies indicate that the performance of this algorithm is as perfect as 2D Midpoint algorithm.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A 3D line segment can be defined with two endpoints, in which Δx≥Δy≥Δz0 , and then Midpoint 2D line algorithm is applied to the projections of line segment on xy and xz coordinate planes respectively, this results in the Midpoint algorithm for 3D straight-line. Case studies indicate that the performance of this algorithm is as perfect as 2D Midpoint algorithm.
Key concepts: Midpoint, Algorithm, Line (geometry), Midpoint method, Line segment, Geometry, Mathematics, Computer science