The notion of quantitative invisibility and the machine rendering of solids

Appel, Arthur

doi:10.1145/280811.280916

Cited by 7 publications

(6 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…not general environment map occlusion). The way we perform line integration is similar to the evaluation of invisibility proposed by Appel [App67], as well as drawing parallels to fundamental work in pre-filtering and anti-aliasing [GT96,JP00].…”

Section: Boundaries and Samplingmentioning

confidence: 94%

Visibility Silhouettes for Semi‐Analytic Spherical Integration

Nowrouzezahrai

Baran

Mitchell

et al. 2013

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

Section: Boundaries and Samplingmentioning

confidence: 94%

Visibility Silhouettes for Semi‐Analytic Spherical Integration

Nowrouzezahrai

Baran

Mitchell

et al. 2013

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

“…Elber and Cohen [1990] perform ray tests on isoparametric curves, and assume that every visible contour is connected to some visible isoparametric curve, which is not true for complex models. More generally, one might propagate Quantitative Invisibility (QI) [Appel 1967;Markosian et al 1997] along arbitrary curves to determine visibility. The QI of a point is defined as the number of surfaces that occlude the point; a point is visible if and only if it has a QI of zero.…”

Section: Ray-tracing Smooth Contoursmentioning

confidence: 99%

Computing smooth surface contours with accurate topology

Bénard

Hertzmann

Kass³

2014

ACM Trans. Graph.

View full text Add to dashboard Cite

This paper introduces a method for accurately computing the visible contours of a smooth 3D surface for stylization. This is a surprisingly difficult problem, and previous methods are prone to topological errors, such as gaps in the outline. Our approach is to generate, for each viewpoint, a new triangle mesh with contours that are topologically-equivalent and geometrically close to those of the original smooth surface. The contours of the mesh can then be rendered with exact visibility. The core of the approach is Contour-Consistency, a way to prove topological equivalence between the contours of two surfaces. Producing a surface tessellation that satisfies this property is itself challenging; to this end, we introduce a type of triangle that ensures consistency at the contour. We then introduce an iterative mesh generation procedure, based on these ideas. This procedure does not fully guarantee consistency, but errors are not noticeable in our experiments. Our algorithm can operate on any smooth input surface representation; we use Catmull-Clark subdivision surfaces in our implementation. We demonstrate results computing contours of complex 3D objects, on which our method eliminates the contour artifacts of other methods.

show abstract

“…Analytic visibility methods were developed early in the history of computer graphics, with the first hidden line/surface elimination algorithms by Appel [App67] and Robert [Rob63]. Sutherland et al [SSS74] presented an excellent survey of other methods and their close relationship to sorting [SSS73].…”

Section: Related Workmentioning

confidence: 99%

“…A hidden line elimination algorithm considers only the occlusion of edge e [App67]. In our case, as we want full hidden surface removal, we have to take into account all the triangles that are occluded by e , too.…”

Section: Analytic Visibilitymentioning

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

The notion of quantitative invisibility and the machine rendering of solids

Cited by 7 publications

References 3 publications

Visibility Silhouettes for Semi‐Analytic Spherical Integration

Visibility Silhouettes for Semi‐Analytic Spherical Integration

Computing smooth surface contours with accurate topology

Analytic Visibility on the GPU

Contact Info

Product

Resources

About