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

Jim van Welzen

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

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

Graphics, computer vision, multimedia, augmented reality and games · 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 · 50% Geometric modeling and processing · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 100%

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

TopicWeightPapersLastEvidence papers
Rendering
graphics pipeline
0.011998
Efficient Polygon Clipping for an SIMD Graphics Pipeline · IEEE Trans. Vis. Comput. Graph. 1998
Geometric modeling and processing › computational geometry › geometric queries › geometric intersection
polygon clipping
0.011998
Efficient Polygon Clipping for an SIMD Graphics Pipeline · IEEE Trans. Vis. Comput. Graph. 1998
Processor architecture and microarchitecture
SIMD
0.011998
Efficient Polygon Clipping for an SIMD Graphics Pipeline · IEEE Trans. Vis. Comput. Graph. 1998

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

edge batching · 0.0deferred clipping · 0.0
YearPublicationVenuePosition
1998 Efficient Polygon Clipping for an SIMD Graphics Pipeline
abstract
SIMD processors have become popular architectures for multimedia. Though most of the 3D graphics pipeline can be implemented on such SIMD platforms in a straightforward manner, polygon clipping tends to cause clumsy and expensive interruptions to the SIMD pipeline. This paper describes a way to increase the efficiency of SIMD clipping without sacrificing the efficient flow of a SIMD graphics pipeline. In order to fully utilize the parallel execution units, we have developed two methods to avoid serialization of the execution stream: deferred clipping postpones polygon clipping and uses hardware assistance to buffer polygons that need to be clipped. SIMD clipping partitions the actual polygon clipping procedure between the SIMD engine and a conventional RISC processor. To increase the efficiency of SIMD clipping, we introduce the concepts of clip-plane pairs and edge batching. Clip-plane pairs allow clipping a polygon against two clip planes without introducing corner vertices. Edge batching reduces the communication and control overhead for starting of clipping on the SIMD engine.
Bengt-Olaf Schneider, Jim van Welzen
IEEE Trans. Vis. Comput. Graph.2