@article{Yuan:1997:PBH,
number = {3},
month = jun,
optnote = {},
author = {Xiaobu Yuan and Hanqiu Sun},
optkey = {},
localfile = {papers/Yuan.1997.PBH.pdf},
journal = j-CAG,
doi = {http://dx.doi.org/10.1016/S0097-8493(97)00013-7},
volume = {21},
opturl = {},
optwww = {},
optstatus = {},
abstract = {Despite the emergence of highly realistic computer-generated
images, line-drawing images are still a common practice in showing
the shapes and movements of three-dimensional objects. It is
especially true when rendering time is critical in interactive
applications such as the modeling and testing stage of computer
aided design/manufacturing, computer animation, and virtual
reality. Hence much effort has been devoted to provide sufficient
information of the displayed objects with the least amount of
time. While the techniques that determine visible surfaces in an
image-space have the advantages on rendering speed and processable
shapes, those that decide visible lines or line segments in an
object-space are more suitable for showing hidden lines. The
P-buffer algorithm introduced in this paper is a method for
rendering line-drawing images with dashed hidden-lines. Being an
image-space method, this algorithm preserves the low computational
cost and works on a wide range of object shapes; as an extension
to the Z-buffer algorithm it, moreover, discloses hidden surfaces
by showing them with dashed lines. After a discussion on rendering
techniques of line-drawing images, this paper presents this
algorithm with pseudocode in C++ programming language and shows
some experimental results as well. This image-space algorithm can
be used as a compromise approach that reveals the concealed
information of hidden-surface-removed views for time-critical
rendering.},
title = {{P}-{B}uffer: {A} {H}idden-{L}ine {A}lgorithm in {I}mage-{S}pace},
year = {1997},
pages = {359--366},
}
|