Ruppert, J., A New and Simple Algorithm for Quality TwoDimensional Mesh Generation, UCB/CSD 92/694, University of California Berkeley Department of Computer Science, 1992 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Implementation of Hamilton-Jacobi and Level Set Equations on.. - Barth, Sethian (1998) (Correct)
....triangle tetrahedron does not contain any other vertex in the triangulation. For example in Fig. 4, the triangle T (v 1 ; v 2 ; v 3 ) is re ned by adding a site at the circumcenter location and recon guring edges using an edge ipping procedure to restore the Delaunay characterization, see [7] [16]. Site Site 1 3 1 3 2 2 Figure 4: Steiner re nement: Site insertion at circumcenter location (left) and edge recon guration (right) We have employed both techniques in the triangulated level set framework. 20 7 Results 7.1 Numerical Accuracy 7.1.1 Smooth Solutions As a rst example, the ....
Ruppert, J., A New and Simple Algorithm for Quality TwoDimensional Mesh Generation, UCB/CSD 92/694, University of California Berkeley Department of Computer Science, 1992
Numerical Schemes for the Hamilton-Jacobi and Level Set.. - Barth, Sethian (1997) (15 citations) (Correct)
....of any triangle tetrahedron does not contain any other vertex in the triangulation. A number of researchers have independently discovered the bene ts of inserting sites at circumcenters of Delaunay triangles to re ne the triangulation and improve measures of grid quality, 7] [24]. For example in Fig. 20, the triangle T (v 1 ; v 2 ; v 3 ) is re ned by adding a site at the circumcenter location and recon guring edges using an edge ipping procedure to restore the Delaunay characterization. Most algorithms follow a procedure similar to that Site Site 1 3 1 3 2 2 Figure 20: ....
J. Ruppert. A new and simple algorithm for quality two-dimensional mesh generation. Technical Report UCB/CSD 92/694, University of California Berkeley Department of Computer Science, 1992.
The Crust and the Beta-Skeleton: Combinatorial Curve.. - Amenta, Bern, Eppstein (1998) (10 citations) (Correct)
....is based on a Local Feature Size function, which in some sense quantifies the local level of detail at a point on smooth curve. Local Feature Size functions are used in the computational geometry literature on mesh generation; the term was first used, to the best of our knowledge, by Ruppert [R92] (with a similar definition) Definition: The Local Feature Size, LFS(p) of a point p 2 F is the Euclidean distance from p to the closest point m on the medial axis. The segment of length LFS(p) between a point p 2 F and the closest point m on the medial axis of F is perpendicular to the medial ....
Ruppert, J., A new and simple algorithm for quality two-dimensional mesh generation, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, (1993), pp. 83-92.
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