M. E. Newell et al. A solution to the hidden surface problem. In Proc. of the ACM Nat. Conf., pages 443--450, 1972.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....is in front) This sort may detect cycles, but it can be proved that cycles do not occur for Delaunay triangulations. Edelsbrunner89] Max90] or for the particular geometries which occur in our climate simulations [Max93a] We are also working on a version of the Newell, Newell, and Sancha sort [Newell72] applied to volume cells instead of to polygons. This algorithm will split offending cells when cycles are detected. It also does not require the adjacency information, which may not be available in certain situations (for example, finite element simulations with sliding interfaces) and can deal ....

Newell, M. E., R. G. Newell, and T. L. Sancha, A solution to the Hidden Surface Problem. Proceedings of the ACM National Conference 1972, pp. 443-450.

....In fact, for most scientific visualization applications it is even to be preferred over realistic transparency as it provides undistorted views of objects occluded by other structures. In nonrefractive transparency the colors of two objects are combined when one object is in front of the other [7]. The intensity I of a pixel onto which two overlapping objects are projected (where Center for Mathematics and Computer Science CWI, P.O. Box 94079, 1090 GB Amsterdam, the Netherlands. E mail: mullie cwi.nl y Faculty of Mathematics, Computer Science, Physics, and Astronomy, University of ....

M.E. Newell, R.G. Newell, and T.L. Sancha. A solution to the hidden surface problem. In Proceedings of the ACM National Conference, pages 443--450, 1972.

....scientific visualization applications it is even to be preferred over realistic transparency as it provides undistorted views of objects occluded by other structures. 1. Introduction 2 In nonrefractive transparency the colors of two objects are combined when one object is in front of the other [7]. The intensity I of a pixel onto which two overlapping objects are projected (where object 1 is in front of object 2) follows from: I = # 1 I 1 (1 # 1 )I 2 (1.1) Coefficient # 1 is the opacity factor of object 1. If # 1 = 1, object 1 is opaque and if # 1 = 0 object 1 is completely ....

M.E. Newell, R.G. Newell, and T.L. Sancha. A solution to the hidden surface problem. In Proceedings of the ACM National Conference, pages 443--450, 1972.

....voxels that they occlude. The key advantage of this approach is that backtracking is avoided carving a voxel affects only voxels encountered later in the sequence. For a single camera, visibility ordering amounts to visiting voxels in a front to back order and may be accomplished by depthsorting (Newell et al. 1972; Fuchs et al. 1980) The problem of defining visibility orders that apply simultaneously to multiple cameras is more difficult, however, because it requires that voxels occlude each other in the same order from different viewpoints. More precisely, voxel p is evaluated before q only if q does ....

Newell, M. E., R. G. Newell, and T. L. Sancha: 1972, `A Solution to the Hidden Surface Problem'. In: Proc. ACM National Conference. pp. 443--450.

....for still frames. These tools and related work are discussed in section 2. Our solution, presented in section 3, is to generate a set of particles that describe a surface, depth sort the particles in camera space, and render them as 2d brush strokes in screen space using a painter s algorithm [7]. The look of the 2d brush strokes, including color, size, and orientation, is derived from the geometry, surface attributes, and lighting characteristics of the surface. These attributes are designed by the user and either associated directly with the particles or encoded in rendered images of ....

Martin E. Newell, R. G. Newell, and T. L. Sancha. A solution to the hidden surface problem. In Proc. ACM Nat. Mtg. 1972.

....is after p in the list, q cannot occlude p. Then during rendering, the ordered polygons are drawn back to front, thus occluding polygons are correctly drawn into the image, covering only those parts that are occluded. Some of the early methods were those of Schumacker et al. 61] and Newell et al. [54] and later Fuchs et al. s BSP trees [29] One of the additional features of the listpriority techniques is that they are able to correctly handle the rendering of transparent objects. Although the methods were originally designed for depth ordering of individual polygons, some of their ideas have ....

M. E. Newell, R. G. Newell, and T. L. Sancha. A solution to the hidden surface problem. Proc. ACM Nat. Mtg., 1972.

....primitives it contains. Opaque scanline segments are directly z buffered. Transparent scanline segments are buffered and handled after all processors complete geometric processing. The transparency segments are first depth sorted via a Newell Newell Sancha depth sort then composited front to back [10]. Parallel Slicing Arbitrary slicing is handled through software based texture mapping. Each slice plane is clipped against a bounding box for each contiguous portion of data held on a processor. The resulting polygons are scan converted with a texture lookup at each pixel. The texture lookup ....

J. Newell, R. Newell, and T. Sancha. A solution to the hidden surface problem. In Proceedings ACM National Conference, pages 443--450, 1972.

....keeping no track of the individual surface facets contributing to it. When generating a field of view, it is precisely the extent of those facets that is recorded, while an image is produced, if at all, only as a byproduct. An often used graphical display algorithm is the depth sort algorithm [Newe72]. A simpler variant of this algorithm is called the painter s algorithm [Fole90, p. 673] In this algorithm, the components of the scene are projected onto the display device in decreasing distance from the viewpoint. Nearer objects are painted after, and therefore over, more distant ones, ....

M.E. Newell, R.G. Newell, and T.L. Sancha. A solution to the hidden surface problem. In Proceedings of the ACM National Conference, pages 443--450, 1972.

....voxels that they occlude. The key advantage of this approach is that backtracking is avoided carving a voxel a#ects only voxels encountered later in the sequence. For a single camera, visibility ordering amounts to visiting voxels in a front to back order and may be accomplished by depthsorting #Newell et al. 1972; Fuchs et al. 1980#. The problem of de#ning visibility orders that apply simultaneously to multiple cameras is more di#cult, however, because it requires that voxels occlude each other in the same order from di#erent viewpoints. More precisely,voxel p is evaluated before q only if q does not ....

Newell, M. E., R. G. Newell, and T. L. Sancha: 1972, `A Solution to the Hidden Surface Problem'. In: Proc. ACM National Conference. pp. 443#450.

....colored, solid surfaces which had been essentially unachievable on vector displays. This system provided the foundation for the modern realistic images which are common in today s interactive applications. Hidden surface removal in these raster systems led to a variety of sorting algorithms [NNS72] War69] Sch69b] and eventually let to the development of the Z buffer [Cat74] which resolved visibility conflicts at the pixel level. Some of these early hidden surface removal methods[App68] GN71] also introduced the notion of ray casting[Rot82] which later formed the bases of modern ....

....overlapping transparent pixels, Z buffered sorting does not provide this facility. In addition, presorting the transparent surfaces suffers from all the traditional hidden surface removal problems such as intersecting surfaces and the need to find a (possibly non existent) correct sort order (e.g. NNS72] In [Mam89] Mammen describes a method which renders the transparent objects in the correct back to front order without presorting. To accomplish this, blending occurs at the pixel level in a series of iterations. At each iteration over the transparent set, the transparent pixels closest to the ....

M. Newell, R. Newell, and T. Sancha. A solution to the hidden surface problem. Proceedings of the ACM National Meeting, 1972.

....colored, solid surfaces which had been previously unachievable on vector displays. This system provided the foundation for the modern realistic images which are common in today s interactive applications. Hidden surface removal in these raster systems led to a variety of sorting algorithms [NNS72] War69] Sch69] and eventually let to the development of the Z buffer [Cat74] which resolved visibility conflicts at the pixel level. Some of these early hidden surface removal methods[App68] GN71] also introduced the notion of ray tracing, which later formed the bases of modern photo realistic ....

M. E. Newell, R. G. Newell, and T. L. Sancha. A solution to the hidden surface problem. In Proc. ACM Nat. Mtg. 1972.

....convex polyhedra with planar faces, whose visibility ordering does not contain cycles. The faces of adjacent cells need not be aligned, and the meshes may have disconnected portions. The algorithm is effectively a 3D generalization of the Newell, Newell and Sancha sort for polygons [3, 19, 20]. A z buffer is incorporated in the rendering engine to serve as a witness to the correctness of the visibility ordering. A correction to the original algorithm reported by Stein et al. is given in Section 6.1; then in Section 6.2 we describe a method that, for large data sets, increases the ....

M. Newell, R. Newell and T. Sancha, "Solution to the Hidden Surface Problem," Proc ACM National Conference, 1972, pp. 443--450.

....own minds and entered the input details by typing commands to select the appropriate engineering components. A further disadvantage of these early CAD systems was that the visualisation capabilities using hidden surface removal techniques like those developed by Newell, Newell and Sancha [Newell72] were slow, particularly for a large complex plant. CADCentre s PDMS is one of the leading 3D CAD systems on the market designed for this type of application. It produces clear and detailed clash detection reports and can provide a graphic output of any clash to help the designer resolve the ....

M.E. Newell, R.G. Newell and T.L. Sancha, A solution to the hidden surface problem, Proc ACM National Conference, 1972, pp. 443 -- 450.

....et al. FDFH90] has a chapter on visible surface determination that includes most of the algorithms developed so far. Specifically, algorithms for hidden surface removal include visible line determination [Rob63, App67] the z buffer (or depthbuffer) algorithm [Cat74] the depth sort algorithm [NNS72] scan line algorithms [WREE67, BK70, Bou70, Wat70] area subdivision algorithms [War69, WA77] and ray tracing [App68] Visibility determination is closely related to depth sorting of primitives. Once the primitives are ordered in depth, they can be rendered back to front for correct visibility. ....

Martin E. Newell, R. G. Newell, and T. L. Sancha. A solution to the hidden surface problem. In Proc. ACM Nat. Mtg. 1972.

....nonintersecting convex polyhedra with planar faces, whose visibility ordering does not contain cycles. The faces of adjacent cells need not be aligned, and the meshes may have disconnected portions. The algorithm is effectively a 3D generalization of the Newell, Newell and Sancha sort for polygons [22, 23]. Williams et al. [34] describe a correction and an optimization to the original Stein algorithm. Even with the optimization, this algorithm does not run in interactive time, e.g. it requires on the order of 3 minutes to sort 200,000 cells and 15 minutes to sort 1,000,000 cells, on an SGI Power ....

M. Newell, R. Newell and T. Sancha, "Solution to the hidden surface problem," Proc ACM National Conference, 1972, pp. 443--450.

.... computation dependent of viewpoint independent of viewpoint plane combine line z buffer ray casting back to front visible segments computation visible polygons computation estimation Watkins [19] Devai [5] Atherton [1] Hamlin Gear [8] Mahl [10] Bronsvoort [3] Pueyo [13] Newel, Newel, Sancha [11] Warnock [18] Fuchs [7] Weiler Atherton [20] Bouknight [2] Schumacker [16] Figure 1: Classification of visibility computation algorithms. The items in boldface underline the basic concepts we consider all students must know. Most of the presentations of visibility computation algorithms focus on ....

M. E. Newell, R. G. Newell and T. L. Sancha, "A Solution to the Hidden Surface Problem", Proceedings of the ACM National Conference, pp. 443--450, 1972.

....The Z buffer algorithm is easy to implement, and any graphics workstation provides it, often in hardware. Nevertheless, there are situations where other approaches can be superior. In the next two subsections we describe two such approaches. 3. 1 Depth sorting methods Depth sorting methods [23] for hidden surface removal scan convert the objects in a back tofront order, instead of in arbitrary order as the z buffer algorithm does. This means that whenever an object is scan converted, we know it is in front of all objects scan converted thusfar. Hence, there is no need for the visibility ....

M.E. Newell, R.G. Newell, and T.L. Sancha. A solution to the hidden surface problem. In Proc. ACM Natl. Conf., pages 443--450, 1972.

No context found.

M. E. Newell et al. A solution to the hidden surface problem. In Proc. of the ACM Nat. Conf., pages 443--450, 1972.

No context found.

M. E. Newell et al. A solution to the hidden surface problem. In Proc. of the ACM Nat. Conf., pages 443--450, 1972.

No context found.

Martin E. Newell, R. G. Newell, and T. L. Sancha. A Solution to the Hidden Surface Problem. In Proc. ACM Nat. Mtg. ACM, 1972.

No context found.

Martin E. Newell, R. G. Newell, and T. L. Sancha. A Solution to the Hidden Surface Problem. In Proc. ACM Nat. Mtg. ACM, 1972.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC