Parallel object-space hidden surface removal

Franklin, W. Randolph; Kankanhalli, Mohan

doi:10.1145/97879.97889

Cited by 8 publications

(1 citation statement)

References 23 publications

(14 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One of the first parallel algorithms was the terrain visibility method by Reif and Sen [RS88], later improved by Gupta and Sen [GS98]. The general setting was treated by Randolph Franklin et al [RFK90] but with worst case asymptotics independent of processor count. Once hardware limitations disappeared, the focus of the community moved to approximate, sampling‐based visibility.…”

Section: Related Workmentioning

confidence: 99%

Analytic Visibility on the GPU

Auzinger

Wimmer

Jescke

2013

Computer Graphics Forum

View full text Add to dashboard Cite

This paper presents a parallel, implementation-friendly analytic visibility method for triangular meshes. Together with an analytic filter convolution, it allows for a fully analytic solution to anti-aliased 3D mesh rendering on parallel hardware. Building on recent works in computational geometry, we present a new edge-triangle intersection algorithm and a novel method to complete the boundaries of all visible triangle regions after a hidden line elimination step. All stages of the method are embarrassingly parallel and easily implementable on parallel hardware. A GPU implementation is discussed and performance characteristics of the method are shown and compared to traditional sampling-based rendering methods.

show abstract

Section: Related Workmentioning

confidence: 99%

Analytic Visibility on the GPU

Auzinger

Wimmer

Jescke

2013

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

Volumes from overlaying 3-D triangulations in parallel

Franklin

Kankanhalli

1993

Advances in Spatial Databases

View full text Add to dashboard Cite

A real-time systolic algorithm for on-the-fly hidden surface removal

Risset

Song

Proceedings of International Conference on Application Specific Array Processors (ASAP '93)

View full text Add to dashboard Cite

Hidden surface removal for real-time realistic display of compler scenes requires intensive computation and justifies usage of parallelism to provide the needed response time. We pnsent a systolic algorithm that identifies visibie segments on a scanline with the "real-time" characteristic: visible segments are output on-the-jly as soon a s segments a n input to the systolic array. The proposed systolic architecture consists of a linear array of simple cells. The sire of the systolic army is equal to the mazimum number of input segments that a n crossed by a vertical line. The correctness of the systolic algorithm is proven by first establishing the correctness of an initial version, which is then successively transformed to more eficient versions, while preserving the properties for correctness.

show abstract

Parallel object-space hidden surface removal

Cited by 8 publications

References 23 publications

Analytic Visibility on the GPU

Analytic Visibility on the GPU

Volumes from overlaying 3-D triangulations in parallel

A real-time systolic algorithm for on-the-fly hidden surface removal

Contact Info

Product

Resources

About