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

Bengt-Olaf Schneider

dblp:71/129 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
0since 2021 · last 2003
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 7 · 5 first-authorHuman-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
2 papers
Rendering · 52% Geometric modeling and processing · 48%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 100%

Topics — the 5 heaviest of 6, 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
Geometric modeling and processing
collision detection
0.011992
Interactive inspection of solids: cross-sections and interferences · SIGGRAPH 1992
Rendering
real-time rendering
0.011992
Interactive inspection of solids: cross-sections and interferences · SIGGRAPH 1992

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

edge batching · 0.0deferred clipping · 0.0adaptive subdivision search · 0.0
YearPublicationVenuePosition
2003 Introduction
Günter Knittel, Bengt-Olaf Schneider
Comput. Graph.2
1999 An adaptive framework for 3D graphics over networks
Bengt-Olaf Schneider, Ioana M. Boier-Martin
Comput. Graph.1
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.1
1997 Guest editors' introduction
Bengt-Olaf Schneider, Andreas Schilling 0001
Comput. Graph.1
1995 M-Buffer: a flexible MISD architecture for advanced graphics
Bengt-Olaf Schneider, Jarek Rossignac
Comput. Graph.1
1992 Interactive inspection of solids: cross-sections and interferences
abstract
To reduce the cost of correcting design errors, assemblies of mechanical parts are modeled using CAD systems and verified electronically before the designs are sent to manufacturing.Shaded images are insufficient for examining the internal structures of assemblies and for detecting interferences.Thus, designers must rely on expensive numerical techniques that compute geometric representations of cross-sections and of intersections of solids.The solid-clipping approach presented here bypasses these geometric calculations and offers realtime rendering of cross-sections and interferences for solids represented by their facetted boundaries.In its simplest form, the technique is supported by contemporary highend graphics workstations.Its variations, independently developed elsewhere, have already been demonstrated.Our implementation is based on the concept of a cutvolume interactively manipulated to remove obstructing portions of the assembly and reveal its internal structure.For clarity, faces of the cut-volume which intersect a single solid are hatched and shaded with the color of that solid.Interference areas between two or more solids are highlighted.Furthermore, to help users find the first occurrence of an interference along a search direction, we have developed an adaptive subdivision search based on a projective approach which guarantees a sufficient condition for object disjointness.The additional performance cost for solid-clipping and interference highlighting is comparable to the standard rendering cost.An efficient implementation of the disjointness test requires a minor extension of the graphics functions currently supported on commercial hardware.
Jarek Rossignac, Abe Megahed, Bengt-Olaf Schneider
SIGGRAPH3
1988 A Processor for an Object-Oriented Rendering System
abstract
Abstract An object oriented approach to the real‐time rendering of raster images is described. The architecture is based on a set of object processors arranged in a pipeline. These object processors scan convert the objects in the scene and interpolate depth and normal vectors across the objects. Hidden surface elimination is distributed along the pipeline. The structure of the object processors and of the algorithms employed are described in detail. Computing Reviews Classification: C. 1.2, C.3, 1.3.1
Bengt-Olaf Schneider
Comput. Graph. Forum1