Scribd
Upload
2K views

Floating Horizon Algorithm

The document describes the floating horizon algorithm, which is used to represent 3D surfaces in the form F(x,y,z)=0. It works by intersecting the 3D surface with parallel cutting planes to reduce it to planar curves, then uses an upper and lower horizon to determine if each curve is visible or hidden based on its y value compared to previous curves in the same z plane. The algorithm assumes y values are available at every x location, interpolating linearly if curves cross and a value is unavailable.

Uploaded by

koolnash8784
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
2K views

Floating Horizon Algorithm

The document describes the floating horizon algorithm, which is used to represent 3D surfaces in the form F(x,y,z)=0. It works by intersecting the 3D surface with parallel cutting planes to reduce it to planar curves, then uses an upper and lower horizon to determine if each curve is visible or hidden based on its y value compared to previous curves in the same z plane. The algorithm assumes y values are available at every x location, interpolating linearly if curves cross and a value is unavailable.

Uploaded by

koolnash8784
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 2

Most commonly used for representation of 3D surfaces of the

form
F(x,y,z)=0
This category of algorithms are usually implemented in image
space.
Fundamental Concept: The technique is to convert 3D
problem to equivalent 2D problem by intersecting 3D surface
with a series of parallel cutting planes at constant values of the
coordinate in the view direction. It could be x, y or z. The function
F(x,y,z)=0 is reduced to a planar curve in each of these parallel
planes y=f(x,z)
It is assumed that the curves are single valued functions of
independent variables.
Floating Horizon Algorithm

Floating Horizon Algorithm

Upper Horizon: If at any given value of x the y value of the
curve in the current plane is larger than the y value for any
previous curve at that z value, then the curve is visible,
otherwise hidden

Lower Horizon: If at any given value of x, the y value of the
curve in the current plane larger than the maximum y value or
smaller than the minimum y value for any previous curve at
that z plane then the curve is visible, else hidden

Functional interpolation: The algorithm assumes the value of
y is available at every x location. However, if it is not available
(crossing of curves), a linear interpolation of known values is
calculated to to fill the upper and lower floating horizon
arrays.

You might also like