An approach to a calculation-minimized hidden line algorithm

Hornung, Christoph

doi:10.1016/0097-8493(82)90005-x

Cited by 12 publications

(2 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Appel[ l] proposed a hidden line removal algorithm based on quantifative invisibility, which stands for the number of covering surfaces such that quantitative invisibility at visible points is equal to zero, He pointed out that quantitative invisibility changes when a point passes through a silhouette edge. Hornung [3] as well as Schweitzer and Cobb [8] indicated that connected silhouette edges form a closed loop. Walter [9] uses silhouette edges as a means for surface rendering.…”

Section: Related Workmentioning

confidence: 97%

Spatial partitioning of solids for solid freeform fabrication

Ramaswami

Yamaguchi

Prinz

1997

Proceedings of the Fourth ACM Symposium on Solid Modeling and Applications - SMA '97

View full text Add to dashboard Cite

Solid Freeform Fabrication (SFF) is a rapid manufacturing process that builds parts by incremental material deposition and fusion of thin 2-l/2 dimensional layers. The layers are generated by slicing the CAD model with a set of parallel planes perpendicular to the build-up direction. A new SFF technology called Shape Deposition Manufacturing (SDM) builds 3-D objects by incremental material deposition and material removal. The advantage of this method results from full 3-D shape control of all object surfaces. In contrast, traditional SFF methods generate surface steps between layers. In SDM, CAD models are partitioned into 3-D layers. The layers are further decomposed into compacts that can be processed in a single step. The compacts are also monotonic with respect to the buildup direction such that a ray cast along the build-up direction from the top enters a compact through its non-undercut surface and exits through its undercut surface. In order to satisfy the monotonicity constraint, the model is partitioned along partition surfaces whose normals are not necessarily along the build-up direction (in contrast to the method currently used in SFF).In this paper, we outline an algorithm which generates these partition surfaces and subsequently 3-D layers and compacts. Silhouette curves separating the undercut surface portion from the nonundercut surface portion are generated for the entire model. The model's surfaces are then split along these silhouette curves to generate monotonic surfaces. The edges adjacent to both undercut and non-undercut surfaces are classified into concave and convex silhouette edges. These edges form silhouette loops that are projected onto a plane perpendicular to the build-up direction. Partition surfaces are obtained as ruled surfaces by sweeping a certain set of silhouette edges along the build-up direction. This set of silhouette edges is obtained if the silhouette edges are concave, if the projected silhouette loop has self-intersections and if the silhouette loops cannot be sorted along the build-up direction. The CAD model is then decomposed into compacts using the partition surfaces. The algorithm was tested by building complex 3-D objects with smooth (step-free) surfaces.

show abstract

Section: Related Workmentioning

confidence: 97%

Spatial partitioning of solids for solid freeform fabrication

Ramaswami

Yamaguchi

Prinz

1997

Proceedings of the Fourth ACM Symposium on Solid Modeling and Applications - SMA '97

View full text Add to dashboard Cite

show abstract

“…Plenty of early algorithms exist for the elimination of hidden lines [Gal69, Hor82] or general curves [EC90]. Line drawings depend in general on these techniques, with the first halo rendering presented by Appel et al [ARS79], and recent development covered in the course by Rusinkiewicz et al [RCDF08].…”

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

An Optimal Hidden-Surface Algorithm and Its Parallelization

Dévai

2011

Computational Science and Its Applications - ICCSA 2011

View full text Add to dashboard Cite

An approach to a calculation-minimized hidden line algorithm

Cited by 12 publications

References 1 publication

Spatial partitioning of solids for solid freeform fabrication

Spatial partitioning of solids for solid freeform fabrication

Analytic Visibility on the GPU

An Optimal Hidden-Surface Algorithm and Its Parallelization

Contact Info

Product

Resources

About