Gold, C.M., T.D. Charters and J. Ramsden, 1977. Automated contour mapping using triangular element data structures and an interpolant over each triangular domain. Computer Graphics, v. 5, pp. 170-175.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....n) time algorithm that constructs a triangulation with maxmin triangle height, and O(n 3 ) time algorithms for triangulations with minmax (three dimensional) slope and with minmax eccentricity of any triangle. Triangulations with maxmin height have been suggested for use in surface approximation [GoCR77], and all three criteria have been mentioned in a survey article on systematic triangulations [WaPh84] Section 2 formulates the most basic version of the edge insertion paradigm, and section 3 gives Edge Insertion for Optimal Triangulations 2 two sufficient conditions for criteria it can ....

C. M. Gold, T. D. Charters and J. Ramsden. Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain. In "Proc. SIGGRAPH, 1977" 11 (1977), 170--175.

....approach has the problem that traversal cannot be done simultaneously by more than one thread of execution without some type of locking mechanism. For these reasons, researchers have investigated methods of traversing subdivisions and other graph like data structures without the use of mark bits [2, 3, 4, 5, 6]. Generally speaking, these techniques use geometric properties of S to de ne a spanning tree T of the vertices, edges or faces of S and then apply a well known tree traversal technique to traverse T using O(1) additional memory. This research was funded by the Natural Sciences and Engineering ....

C. M. Gold, T. D. Charters, and J. Ramsden. Automated contour mapping using triangular element data and an interpolant over each irregular triangular domain. Computer Graphics, 11(2):170-175, 1977.

....justified by the work of Matou sek et al. correctness follows from our analysis below. Minimum angle, however, is not the only measure of mesh quality. Various papers have provided theoretical justification for other measures including maximum angle [4] maximum edge length [32] minimum height [23], minimum containing circle [12] and most recently ratio of area to sum of squared edge lengths [6] Data dependent criteria [6, 16, 31] may be used in adaptive meshing, which uses the finite element method s output to improve the mesh for another run. In this paper, we study ....

C. Gold, T. Charters, and J. Ramsden. Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain. Proc. SIGGRAPH, 1977, pp. 170--175.

....is that subdivision traversal cannot be performed by two users at the same time. An algorithm for the traversal of triangulated subdivisions, or triangulated irregular networks, that did not require mark bits to record what triangles had been visited and which had not was developed by Gold et al. [11] (see also Gold and Maydell [12] and Gold and Cormack[10] Their method involved choosing one starting point, and defining for each triangle exactly one incident edge through which the triangle could be entered. With the correct definitions and choices one can make sure that every triangle in the ....

.... not address non convex subdivisions; see also Fukuda and Rosta [9] A generic algorithm for traversing graph like data structures without storing any information about the visited parts of the data structure was developed by Avis and Fukuda [2] In this paper we extend the result of Gold et al. [11] and Edelsbrunner et al. 7] to traverse subdivisions without using mark bits. Our ideas are similar to those of Avis and Fukuda [2] and of Edelsbrunner et al. 7] Unlike their methods, our algorithm applies to any subdivision of which the vertices and edges form a connected graph. Furthermore, ....

C. M. Gold, T. D. Charters, and J. Ramsden. Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain. Computer Graphics, 11(2):170--175, 1977.

....is that they must be reset after traversal, which may be a source of inefficiency. An algorithm for the traversal of triangulated subdivisions, or triangulated irregular networks, that didn t require mark bits to record what triangles had been visited and which hadn t was developed by Gold et al. [6] (see also Gold and Maydell [7] and Gold and Cormack [5] Related work has been done by Avis and Fukuda [1] and Fukuda and Rosta [4] In this paper we extend the results of Gold et al. 6] and Edelsbrunner et al. 3] to traverse any connected subdivision without using mark bits. Our ideas are ....

.... require mark bits to record what triangles had been visited and which hadn t was developed by Gold et al. 6] see also Gold and Maydell [7] and Gold and Cormack [5] Related work has been done by Avis and Fukuda [1] and Fukuda and Rosta [4] In this paper we extend the results of Gold et al. [6] and Edelsbrunner et al. 3] to traverse any connected subdivision without using mark bits. Our ideas are similar to those of Avis and Fukuda [1] Recently we found out that Snoeyink obtained similar results [10] Our algorithms can handle both convex and non convex subdivisions, and apply to ....

C. M. Gold, T. D. Charters, and J. Ramsden. Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain. Computer Graphics, 11(2):170--175, 1977.

No context found.

Gold, C.M., T.D. Charters and J. Ramsden, 1977. Automated contour mapping using triangular element data structures and an interpolant over each triangular domain. Computer Graphics, v. 5, pp. 170-175.

.... which do not require any geometric information, or using the Visibility Ordering of a triangulation [GC87, FFNP91, GNY96, BKO97, SS97] It is also possible to walk from some starting point to some destination point through edges of the triangulation using the CCW orientation test on vertices [GCR77, GS85] (although it should be noted that this algorithm is only guaranteed for Delaunay triangulations) 5.2 The Quad Arc data structure The original Voronoi structure contains far too many individual points to be used as an archival mechanism, or for internal processing of polygonal maps. It would be ....

Gold, C.M., T.D. Charters and J. Ramsden, 1977. Automated contour mapping using triangular element data structures and an interpolant over each triangular domain. Computer Graphics, v. 5, pp. 170-175.

No context found.

C. Gold, U. Maydell, and J. Ramsden. Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain. Computer Graphic, 11(2):170--175, 1977.

No context found.

C. Gold, U. Maydell, and J. Ramsden. Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain. Computer Graphic, 11(2):170--175, 1977.

No context found.

C. M. Gold, T. D. Charters, and J. Ramsden. Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain. Computer Graphics, 11(2):170-175, 1977.

No context found.

C. M. Gold, T. D. Charters and J. Ramsden. Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain. In "Proc. SIGGRAPH, 1977" 11 (1977), 170--175.

No context found.

C. Gold, T. Charters, and J. Ramsden. Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain, Proc. Siggraph, 1977, 170--175. 21

No context found.

C. M. Gold, T. D. Charters, and J. Ramsden. Automated contour mapping using triangular element data and an interpolant over each irregular triangular domain. Computer Graphics, 11(2):170-175, 1977.

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