Memorial University DAI: D-Buffer : a new hidden-line algorithm in image-space

advanced search

Digital Archives Initiative
Memorial University - Electronic Theses and Dissertations 3

menu off

add document to favorites : add page to favorites : reference url

back to results : previous : next

Search this object:

0 hit(s) :: previous hit : next hit

View:

previous page : next page

Document Description

Title	D-Buffer : a new hidden-line algorithm in image-space
Author	Dong, Xiaomin, 1967-
Description	Thesis (M.Sc.)--Memorial University of Newfoundland, 1999. Computer Science
Date	1999
Pagination	xi, 74 leaves : ill.
Subject	Buffer storage (Computer science); Computer algorithms; Image processing--Digital techniques
Degree	M.Sc.
Degree Grantor	Memorial University of Newfoundland. Dept. of Computer Science
Discipline	Computer Science
Language	eng
Notes	Bibliography: leaves 59-64
Abstract	In many applications such as computer-aided design (CAD), drafting, descriptive geometry, geometric modeling, computer animation, and virtual reality, etc.. real-time or time-critical rendering is required by three-dimensional interaction and manipulation to provide adequate information of complex objects. Traditionally, rendering techniques can be discussed in two major categories: shaded mode and wireframe mode. While shaded rendering algorithms create more realistic pictures, wireframe techniques are more efficient for generating line-drawing images that are often more informative. In wireframe images, it is preferred to display the hidden-lines in a special style to distinguish them from ordinary visible lines. Thus hidden-line algorithms are needed. Though object-space hidden-line algorithms are widely adopted for showing hidden-lines in distinctive styles, image-space algorithms have the advantages of rendering speed and processable shapes for their simplicity. This thesis develops a new image-space algorithm based on the traditional Z-Buffer algorithm to recover the information loss caused by hidden-line removal. This D-Buffer algorithm improves the Z-Buffer algorithm by drawing the hidden-lines in dotted or dashed style rather than removing them, hence retrieving the concealed information. Some image processing techniques, such as neighborhood operations, are used to generate the dotted or dashed lines. The D-Buffer algorithm is not only as efficient as other image-space algorithms, but is also capable of disclosing more inner structure information for a wide range of three-dimensional objects.
Type	Text
Resource Type	Electronic thesis or dissertation
Format	Image/jpeg; Application/pdf
Source	Paper copy kept in the Centre for Newfoundland Studies, Memorial University Libraries
Local Identifier	a1393756
Rights	The author retains copyright ownership and moral rights in this thesis. Neither the thesis nor substantial extracts from it may be printed or otherwise reproduced without the author's permission.
Collection	Electronic Theses and Dissertations
Scanning Status	Completed
PDF File	(16.20 MB) -- http://collections.mun.ca/PDFs/theses/Dong_Xiaomin.pdf
CONTENTdm file name	40660.cpd