Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wen-Teng Wang

dblp:02/4451 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1996
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Rendering · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Rendering
hidden surface removal
0.011996
The Feudal Priority Algorithm on Hidden-Surface Removal · SIGGRAPH 1996
Rendering
real-time rendering
0.011996
The Feudal Priority Algorithm on Hidden-Surface Removal · SIGGRAPH 1996
Rendering
view-dependent rendering
0.011996
The Feudal Priority Algorithm on Hidden-Surface Removal · SIGGRAPH 1996

Methods — techniques the papers use, named apart from their topics

separating plane · 0.0polygon splitting · 0.0feudal priority tree · 0.0
YearPublicationVenuePosition
1996 The Feudal Priority Algorithm on Hidden-Surface Removal
abstract
Development of a real-time shaded rendering approach for a frequently changing viewpoint or view vector is very important in the simulation of 3-D objects in Computer-Aided Design.A new approach is proposed in this paper to meet this demand in a very efficient manner.A pre-processing phase, in which a feudal priority tree is established for all polygons of an object, and a post-processing phase, in which a rendering priority list is searched for from the feudal priority tree for a new viewpoint or view vector, are included in our approach.The most time-consuming work is finished in the pre-processing phase which only has to be executed once for an object, and the relatively simple task is left to the post-processing phase, which is repeated when the viewpoint or view vector is changed.For the pre-processing phase, a static version and a dynamic version are proposed in this paper.The one-way priority relations of all polygons are computed in the former part of the dynamic pre-processing in a more efficient way than that in the static pre-processing, but the latter part of the dynamic preprocessing is still based on the static pre-processing.A new concept of "absolute priority" is introduced to systematically reduce the polygons in which a separating plane is to be searched for so the probability of finding the separating plane is much increased.This is the basis to implement another important concept of "separating before splitting" by which the polygon splittings are much reduced.Hence the efficiency in the pre-processing and the post-processing phases is highly increased.
Han-Ming Chen, Wen-Teng Wang
SIGGRAPH2