Hidden Line Removal

Hidden line removal is an extension of wireframe rendering where lines (or segments of lines) covered by surfaces are not drawn. This is not the same as hidden face removal since this involves depth and occlusion while the other involves normals. An commonly used algorithm to implement it is Arthur Appel's algorithm (developed at IBM in the late 1960's). This algorithms works by propagating the visibility from a segment with a known visibility to a segment whose visibility is yet to be determined. Certain pathelogical cases exist in making this algorithm difficult to implement, those cases are (i) verticies on edges and (ii) edges on verticies and (iii) edges on edges. James Blinn published a paper on this problem. See http://wheger.tripod.com/vhl/vhl.htm for a further description and more citiations.

 

<< PreviousWord BrowserNext >>
list of uk radio programs
list of canadian radio programs
pompeyo davalillo
list of u.s. radio programs
particle in cell
theologico political treatise
market garden
phanom rung historical park
cable (comics)
osogbo
list of traditional star names
tully fisher relation
enugu
major barbara
hanky panky cocktail
deor
shadoe stevens
atalante miglioretti
raf bishopscourt
lexington steele
david mills
the war chief
fazio cardano
mo udall
jags
strong vincent
ilorin
ghe
richard brodie
iacomo andrea
ze
james matthew lee
combined cadet force
officers training corps
american bar
tse (cyrillic)
air training corps
sea cadet corps
sha
liar's poker
army cadet force
dean stockwell
a9.com
list of people from kentucky