@article{Veenstra:1988:LDO,
number = {1},
optissn = {07300301},
optreview = {ACM CR 88100807},
author = {Jack Veenstra and Narendra Ahuja},
localfile = {papers/Veenstra.1988.LDO.pdf},
optkeywords = {algorithms; hidden line removal; threedimensional
representation},
optmonth = jan,
journal = jTOG,
doi = {http://doi.acm.org/10.1145/42188.42189},
volume = {7},
optstatus = {OK},
optsubject = {{\bf I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation.},
abstract = {The octree structure represents the space occupied by an object as
a juxtaposition of cubes, where the sizes and position coordinates
of the cubes are integer powers of 2 and are defined by a
recursive decomposition of threedimensional space. This makes the
octree structure highly sensitive to object location and
orientation, and the threedimensional shape of the represented
object obscure. It is helpful to be able to see the actual object
represented by an octree, especially for visual performance
evaluation of octree algorithms. Presented in this paper is a
display algorithm that helps visualize the threedimensional space
represented by the octree. Given an octree, the algorithm produces
a line drawing of the objects represented by the octree, using
parallel projection, from any specified viewpoint with hidden
lines removed. The order in which the algorithm traverses the
octree has the property that if node x occludes node y, then node
x is visited before node y. The algorithm produces a set of long,
straight visible edge segments corresponding to the visible
surface of the polyhedral object represented by the octree.
Examples of some line drawing produced by the algorithm are given.
The complexity of the algorithm is also discussed.},
title = {{L}ine {D}rawings of {O}ctree{R}epresented {O}bjects},
pages = {6175},
year = {1988},
}
