D. A. Lindholm. Automatic triangular mesh generation on surfaces of polyhedra. IEEE Trans. Magnetics MAG-19 (1983), 2539--2542. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Edge Insertion for Optimal Triangulations - Bern, Edelsbrunner, Eppstein.. (1993) (15 citations) (Correct)
....Though usually simple to verify, conditions (I) and (II) are somewhat restrictive. It would be interesting to find conditions weaker than (I) even though the price to pay may be implementations of the paradigm that take more than cubic time. Listings of optimality criteria can be found in [Barn77, BeEp92, Lind83, Schu87]. Furthermore, implementations for criteria satisfying (I) and (II) that run in time o(n 3 ) and o(n 2 log n) are sought. Acknowledgment The authors thank two anonymous referees for suggestions on improving the style of this paper. ....
D. A. Lindholm. Automatic triangular mesh generation on surfaces of polyhedra. IEEE Trans. Magnetics MAG-19 (1983), 2539--2542.
Edge Insertion for Optimal Triangulations - Bern, Edelsbrunner, Eppstein.. (1992) (15 citations) (Correct)
....Though simple to be verified, conditions (I) and (II) are somewhat restrictive. It would be interesting to find conditions weaker than (I) even though the price to pay may be implementations of the paradigm that take more than cubic time. Listings of optimality criteria can be found in [Barn77, Lind83, Schu87]. Furthermore, implementations for criteria satisfying (I) and (II) that run in time o(n 3 ) and o(n 2 log n) are sought. ....
D. A. Lindholm. Automatic triangular mesh generation on surfaces of polyhedra. IEEE Trans. Magnetics MAG-19 (1983), 2539--2542.
Optimal Two-Dimensional Triangulations - Tan (1993) (4 citations) (Correct)
.... in computations [FrFi91] It is, however, an NPcomplete problem to decide whether a point set with constraining edges has a triangulation with vertex degree at most 7 [Jans92] No solution is known for the next problem compiled from [Schu87, page 222] Barn77, page 84] GeSh90, page 202] and [GCR77, Lind83]. Problem 6 Can a min max or a max min optimal triangulation based on any one of the following quality measures be computed efficiently: area; aspect ratio; degree; radius of inscribed circle; ratio of the area of the inscribed circle to the area of the triangle; ratio of the diameter of the ....
D. A. Lindholm. Automatic triangular mesh generation on surfaces of polyhedra. IEEE Trans. Magnetics MAG-19 (1983), 2539--2542.
Anisotropic Mesh Generation with Particles - Bossen (1996) (3 citations) (Correct)
....to generate Delaunay meshes in the Riemannian space defined by the metric. 1.1 Previous Work There are several surveys available on mesh generation [2, 15] Most of present mesh generation algorithms are structured in the following way. First a mesh is build with methods such as advancing front [19, 21, 23], quadtree decomposition [35] or by greedy point insertion [3, 32] The quality of the mesh is further improved with the use of smoothing. The most common method is Laplacian smoothing [8] Advancing front methods start meshing at the boundaries of the domain. A list of nodes to be expanded ....
D.A. Lindholm. Automatic triangular mesh generation on surfaces of polyhedra. IEEE Trans. Magnetics, 19:2539--2542, 1983.
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