Results 181 to 190 of about 29,306 (220)

Development of Automated 3D LiDAR System for Dimensional Quality Inspection of Prefabricated Concrete Elements. [PDF]

Sensors (Basel)
Li S, Zhang B, Zheng J, Wang D, Liu Z.
europepmc   +1 more source

A novel algorithm for streamlined surgeon-dominated patient-specific implant design in computer-assisted jaw reconstruction. [PDF]

3D Print Med
Nayak A, Pu JJ, Yu X, Su YX.
europepmc   +1 more source

Quantifying the shape of cells - from Minkowski tensors to p-atic orders

Happel L, Oberschelp G, Grudtsyna V, Jain HP, Sknepnek R, Doostmohammadi A, Voigt A.   +6 more
europepmc   +1 more source

Low-power polygon renderer for computer graphics

Proceedings of International Conference on Application Specific Array Processors (ASAP '93), 2002
Polygon rasterization is the most computational and memory intense stage in rendering synthesized computer images. The authors present a low-power, real-time hardware implementation for this task. Rasterization of two-dimensional Gouraud-shaded polygons at 90,000 polygons/sec is achievable with computational power consumption of about 12 mW at 1.5 V ...
W.-C. Tan, T.-Y. Meng
openaire   +3 more sources

Parallel polygon rendering on the graphics computer VC-1

Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis, 2002
This paper describes a parallel polygon rendering method on the graphics computer VC-1. The architecture of the VC-1 is a loosely-coupled array of general-purpose processors, each of which is equipped with a local frame buffer. The contents of the local frame buffers are merged into one in real time considering the visibility control based on screen ...
S. Nishimura, Tosiyasu L. Kunii
openaire   +3 more sources

A low-power high performance polygon renderer for computer graphics

Journal of VLSI signal processing systems for signal, image and video technology, 1995
Polygon rasterization is one of the most computational and memory intensive operations in computer graphics. In this paper, we present a low-power, real-time hardware design for this task. The system is resolution-independent by configuring different numbers of render engines in a 2-dimensional array.
Wee-Chiew Tan, Teresa H. Meng
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

The 4D-MP graphics superworkstation: computing+graphics=40 MIPS+MFLOPS and 100000 lighted polygons per second

Digest of Papers. COMPCON Spring 88 Thirty-Third IEEE Computer Society International Conference, 1988
The 4D-MP graphics superworkstation, which brings 40 MIPS (million instructions per second) of computing performance to a graphics superworkstation is described. It also delivers 40 MFLOPS (million floating-point operations per second) of geometry processing performance, enabling 100000 lighted, four-sided, concave-tested polygons to be processed per ...
D. Solomon, F. Baskett, T. Jermoluk
openaire   +2 more sources

Computation of penetration measures for convex polygons and polyhedra for graphics applications

Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238), 2002
Algorithms to compute measures of penetration between convex polygonal objects in /spl Rfr//sup 2/ and convex polyhedral objects in /spl Rfr//sup 3/ are presented. The algorithms are analyzed for their asymptotic complexity. Details of implementation on a single processor machine are given. Parallelization of the algorithms is discussed.
openaire   +2 more sources