Study for Applying Computer-Generated Images to Visual Simulation

Schmacher, R.; Brand, B.; Gilliland, M.; Sharp, Werner H

doi:10.1037/e510842009-001

Cited by 34 publications

(35 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, it is more difficult to find a hardware strategy general enough to accommodate the different algorithms. However, if only realtime algorithms are considered (thus eliminating ray-tracing [26], Warnock's area-sampling [24] and other non realtime approaches [5,10,13]) the number of possible algorithms can be reduced to either polygon approaches (priority or depth-list [8,14] and z-buffer algorithms [7]) or scan-line approaches [25]. Polygon approaches render one polygon at a time, in isolation from all the rest: this rendering involves finding which scan-lines are intersected by the area of the polygon and filling them with the polygon's colour.…”

Section: Second Division: Topology and Scan Conversionmentioning

confidence: 99%

“…In realtime applications, the compromise between depth-priority calculations performed in object space and final display on image space uses the best of both approaches. Schumacker's [14] a priori binary-tree approach is well suited for static scenes, because it takes advantage of several priority characteristics of scenes for flight simulators in which the scene is static and only the viewpoint changes. Most of the priority calculations are performed offline, minimizing the priority computations between polygons at run-time.…”

Section: An Algorithm For Hidden-surface Removalmentioning

confidence: 99%

See 1 more Smart Citation

Low-cost hardware platform for developing realtime 3D graphics

Serra

Rhodes

1990

The Visual Computer

View full text Add to dashboard Cite

BRAD3D, a low-cost hardware platform for the development of a realtime 3D graphics software is presented. The BRAD3D configuration is derived from a generalization of 3D image synthesis. Three basic processes have been identified: the geometric process, dealing with the measurements of the scene; the topologic process, extracting visible information from the polygonal structure; and the scan-conversion process, producing pixel values on a frame buffer. BRAD3D is implemented as a three-stage pipeline and accommodates depth-list and scan-line hidden-surface-removal algorithms. Each stage of the pipeline can be implemented using different hardware solutions. A microprocessor-based solution is presented as a general prototyping approach.

show abstract

Section: Second Division: Topology and Scan Conversionmentioning

confidence: 99%

Section: An Algorithm For Hidden-surface Removalmentioning

confidence: 99%

Low-cost hardware platform for developing realtime 3D graphics

Serra

Rhodes

1990

The Visual Computer

View full text Add to dashboard Cite

show abstract

“…Based on an approach first utilized by Schumacker et al (1969) it was originally developed in the context of 3D computer graphics for determining the visibility of surfaces during the rendering process of static scenes (Fuchs et al, 1980). Since then it has been adapted for a variety of applications such as ray-tracing (Naylor and Thibault, 1986), shadow generation (Chin and Feiner, 1989), solid modeling (Paterson and Yao, 1990), and image compression (Radha et al, 1996).…”

Section: Building Reconstruction Based On Binary Space Partitioningmentioning

confidence: 99%

Integration of Building Knowledge Into Binary Space Partitioning for the Reconstruction of Regularized Building Models

Wichmann

Jung

Sohn

et al. 2015

ISPRS Ann. Photogramm. Remote Sens. Spatial Inf. Sci.

View full text Add to dashboard Cite

ABSTRACT:Recent approaches for the automatic reconstruction of 3D building models from airborne point cloud data integrate prior knowledge of roof shapes with the intention to improve the regularization of the resulting models without lessening the flexibility to generate all real-world occurring roof shapes. In this paper, we present a method to integrate building knowledge into the data-driven approach that uses binary space partitioning (BSP) for modeling the 3D building geometry. A retrospective regularization of polygons that emerge from the BSP tree is not without difficulty because it has to deal with the 2D BSP subdivision itself and the plane definitions of the resulting partition regions to ensure topological correctness. This is aggravated by the use of hyperplanes during the binary subdivision that often splits planar roof regions into several parts that are stored in different subtrees of the BSP tree. We therefore introduce the use of hyperpolylines in the generation of the BSP tree to avoid unnecessary spatial subdivisions, so that the spatial integrity of planar roof regions is better maintained. The hyperpolylines are shown to result from basic building roof knowledge that is extracted based on roof topology graphs. An adjustment of the underlying point segments ensures that the positions of the extracted hyperpolylines result in regularized 2D partitions as well as topologically correct 3D building models. The validity and limitations of the approach are demonstrated on real-world examples.

show abstract

“…To this end, polygonal modeling of the objects is required. BSP trees are a widely used structure for hierarchical polyhedron representation [6,7,8]. In our approach, the BSP tree representation is extended such that each splitting plane has a tolerance interval for the offset from the origin to represent the intervals in the vertices of the polyhedra, resulting in a "thickness".…”

Section: Tolerance Based Collision Testsmentioning

confidence: 99%

Result Verification of RRT‐based Single‐Query Path Planning through Interval Analysis

Grimm

2008

Proc Appl Math and Mech

View full text Add to dashboard Cite

Single-query path planning is still an open research field. A very promising approach is the use of Rapidly-exploring Random Trees (RRTs). In this approach two RRTs are constructed, one starting from the initial configuration and one from the goal configuration. In comparison with other approaches, this methodology is very efficient in high-dimensional configuration spaces.However, a naive implementation of this approach results in reliability problems: For the construction of an RRT, only discrete configurations are tested for feasibility, while continuous transitions between configurations are not. Furthermore, numerical computations are performed in a floating point arithmetic without accounting for round-off errors. In this work an advanced algorithm will be presented that incorporates interval analysis to eliminate these problems and yield reliable results.

show abstract

Study for Applying Computer-Generated Images to Visual Simulation

Cited by 34 publications

References 0 publications

Low-cost hardware platform for developing realtime 3D graphics

Low-cost hardware platform for developing realtime 3D graphics

Integration of Building Knowledge Into Binary Space Partitioning for the Reconstruction of Regularized Building Models

Result Verification of RRT‐based Single‐Query Path Planning through Interval Analysis

Contact Info

Product

Resources

About