Results 1  10
of
14
Pipeline Rendering: Interaction And Realism Through HardwareBased MultiPass Rendering
, 1996
"... ..."
Interactive Rendering of CSG Models
, 1996
"... We describe a CSG rendering algorithm that requires no evaluation of the CSG tree beyond normalization and pruning. It renders directly from the normalized CSG tree and primitives described (to the graphics system) by their facetted boundaries. It behaves correctly in the presence of user defined, ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
We describe a CSG rendering algorithm that requires no evaluation of the CSG tree beyond normalization and pruning. It renders directly from the normalized CSG tree and primitives described (to the graphics system) by their facetted boundaries. It behaves correctly in the presence of user defined, "near" and "far" clipping planes. It has been implemented on standard graphics workstations using Iris GL and OpenGL graphics libraries. Modestly sized models can be evaluated and rendered at interactive (less than a second per frame) speeds. We have combined the algorithm with an existing Brep based modeller to provide interactive rendering of incremental updates to large models.
Correct Shading of Regularized CSG Solids using a DepthInterval Buffer
 IN EUROGRAPHICS WORKSHOP ON GRAPHICS HARDWARE
, 1990
"... A convenient interactive design environment requires efficient facilities for shading solid models represented in CSC. Shading techniques based on boundary evaluation or ray casting that require calculations of geometric intersections are too inefficient for interactive graphics when CSC primitives ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
A convenient interactive design environment requires efficient facilities for shading solid models represented in CSC. Shading techniques based on boundary evaluation or ray casting that require calculations of geometric intersections are too inefficient for interactive graphics when CSC primitives with curved (parametric) surfaces are involved. Projective approaches, where the primitive surfaces are scanconverted using standard hardwaresupported graphic functions are preferred. Since not all the points of the faces of a CSC primitive lie on the CSC solid, scan conversion must be combined with a procedure that tests the produced 3D surfacepoints against the original CSC expression. Point classifications against primitives defined by arbitrary curved boundaries may be performed, without geometric intersections, through depthcomparisons at each pixel. This approach has been implemented for the PixelPower machine by researchers at UNC. It deals with complex CSC trees by converting CSC expressions into sumofproduct form and repeatedly scanconverting the primitives of each product. The Trickle algorithm, which considerably reduces the number of scanconversions in the general case has been developed at IBM Research and presented elsewhere. This paper discusses several recent improvements to the original Trickle algorithm. The overall algorithm has been simplified. The " scanconversion process and the point classification tests have been modified to correctly handle cases where several primitive faces coincide within an arbitrary numerical resolution. These enhancements are not only necessary for on/on cases in regularized Boolean expressions, but also for processing pairs of faces near their common edges. Finally, we point out that a simple twopass extension of the trickle algorithm using an auxiliary shadow buffer suffices to compute directly from CSC shaded images with shadows.
Blist: A Boolean list formulation of CSG trees
, 1998
"... Set membership classification algorithms visit nodes of a CSG tree through a recursive divideandconquer process, which stores intermediate results in a stack, whose depth equals the height, H, of the tree. During this process, the candidate sets is usually subdivided into uniform cells, whose inte ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Set membership classification algorithms visit nodes of a CSG tree through a recursive divideandconquer process, which stores intermediate results in a stack, whose depth equals the height, H, of the tree. During this process, the candidate sets is usually subdivided into uniform cells, whose interior is disjoint from primitives' boundaries. Cells inside the CSG object are identified by combining the binary results of classifying them against the primitives. In parallel systems, which allocate a different process to each leaf of the tree, and in algorithms that classify large collections of regularly spaced candidate sets (points, pixels, voxels, rays, or crosssections) against the primitives using forward differences, a separate stack is associated with each candidate or cell. Our new representation for CSG trees, called Blist, distributes the merging operation to the primitives and reduces the storage requirement for each cell to log(H+1) bits. Blist can represent any Boolean expr...
Interactive Boundary Computation of Boolean Combinations of Sculptured Solids
 EUROGRAPHICS ’97, D. Fellner and L. SzirmayKalos (Guest Editors)
, 1997
"... We present algorithms and systems for interactive boundary computation of Boolean combinations of sculptured solids. The algorithm is applicable to all spline solids and computes an accurate boundary representation.To speed up the computation, the algorithm exploits parallelism at all stages. It has ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present algorithms and systems for interactive boundary computation of Boolean combinations of sculptured solids. The algorithm is applicable to all spline solids and computes an accurate boundary representation.To speed up the computation, the algorithm exploits parallelism at all stages. It has been implemented on a multiprocessor SGI and takes one second on average per boolean operation to compute the boundary of high degree primitives. The system has also been integrated with an immersive design and manipulation environment. The resulting system is able to interactively evaluate boundaries of the models, display them for model validation and place them at appropriate position using collision detection algorithms.
On the Computational Requirements of Virtual Reality Systems
, 1997
"... The computational requirements of highquality, realtime rendering exceeds the limits of generally available computing power. However illumination effects, except shadows, are less noticeable on moving pictures. Shadows can be produced with the same techniques used for visibility computations, ther ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The computational requirements of highquality, realtime rendering exceeds the limits of generally available computing power. However illumination effects, except shadows, are less noticeable on moving pictures. Shadows can be produced with the same techniques used for visibility computations, therefore the basic requirements of realtime rendering are transformations, preselection of the part of the scene to be displayed and visibility computations. Transformations scale well, ie, their time requirement grows linearly with the input size. Preselection, if implemented by the traditional way of polygon clipping, has a growing rate of N log N in the worst case, where N is the total number of edges in the scene. Visibility computations, exhibiting a quadratic growing rate, are the bottleneck from a theoretical point of view. Three approaches are discussed to speed up visibility computations: (i) reducing the expected running time to O(N log N ) (ii) using approximation algorithms with ...
Application of the RayRepresentation and a Massively Parallel Special Purpose Computer to Problems of Protein Structure and Function: I. Methodology for Calculation of Molecular Contact . . .
, 1994
"... Methodology is developed to apply rayrepresentations to geometric analysis of spacefilling models of protein structure. The following specific problems are treated. First, we define the rayrepresentation for fusedsphere models of proteins. Second, using the rayrepresentation, we treat computati ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Methodology is developed to apply rayrepresentations to geometric analysis of spacefilling models of protein structure. The following specific problems are treated. First, we define the rayrepresentation for fusedsphere models of proteins. Second, using the rayrepresentation, we treat computation of molecular contact surfaces in solution via Minkowski dilation and erosion. Third, we describe how all points of the molecular contact surface can be tagged according to their chemical properties. Fourth, we show how equivalence set methods can be applied to ray representations of proteins in order to identify internal empty spaces and classify their connectedness to the outside. Fifth, we develop filters to analyze the morphology of interstitial spaces in proteins which connect to the outside. Sixth, we discuss how Boolean algorithms can be used to determine whether water molecules identified in Xray crystallography are inside, outside, or intersecting the boundary defined by the solv...
TABLE OF CONTENTS
"... 2.1. Casein kinase 2 functions in eukaryotic cells 2.2. Physiological and evolutionary implications for existence of a bacterial CK2 predecessor ..."
Abstract
 Add to MetaCart
2.1. Casein kinase 2 functions in eukaryotic cells 2.2. Physiological and evolutionary implications for existence of a bacterial CK2 predecessor
High Speed and High Fidelity Visualization of Complex CSG Models
"... We present a system for fast and accurate display of CSG (constructive solid geometry) models. Such models have as primitives, polyhedra and solids whose boundaries can be represented using rational spline surfaces. As a part of preprocessing, we compute the Brep (boundary representation) from the ..."
Abstract
 Add to MetaCart
We present a system for fast and accurate display of CSG (constructive solid geometry) models. Such models have as primitives, polyhedra and solids whose boundaries can be represented using rational spline surfaces. As a part of preprocessing, we compute the Brep (boundary representation) from the CSG tree and represent the resulting solid using trimmed spline surfaces. No assumptions are made on the number of primitives or the degree of the primitives in the CSG tree. Given a trimmed spline model, we tessellate it into polygons as a function of the viewing parameters and render it using visibility culling and coherence between successive frames. The choice of a analytic representation of the model and the trimming curves is fundamental to the fast performance of the system. The system has been used to convert parts of a submarine storage and handling system model represented as more than 2; 000 CSG trees. The Brep consists of more than 30; 000 trimmed spline surfaces and is displaye...