Showing papers on "Delaunay triangulation published in 1974"
TL;DR: A new algorithm for the semi-automatic triangulation of arbitrary, multiply connected planar domains based upon a modification of a finite element mesh genration algorithm recently developed is described.
Abstract: The object of this paper is to describe a new algorithm for the semi-automatic triangulation of arbitrary, multiply connected planar domains. The strategy is based upon a modification of a finite element mesh genration algorithm recently developed. 1 The scheme is designed for maximum flexibility and is capable of generating meshes of triangular elements for the decomposition of virtually any multiply connected planar domain. Moreover, the desired density of elements in various regions of the problem domain is specified by the user, thus allowing him to obtain a mesh decomposition appropriate to the physical loading and/or boundary conditions of the particular problem at hand. Several examples are presented to illustrate the applicability of the algorithm. An extension of the algorithm to the triangulation of shell structures is indicated.
261 citations
15 Oct 1974
TL;DR: Efficiency curves of computing cost v.s. accuracy were constructed for Adams integrators of order of 2 through 15 with several correcting algorithms and for a Runga-Kutta integrator.
Abstract: Orbit equations with a set of conservative and a set of nonconservative perturbing potentials were considered. Scheifele's DS formulation of these equations has dependent variables similar to Delaunay's orbital elements with the true anomaly as the independent variable. Efficiency curves of computing cost v.s. accuracy were constructed for Adams integrators of order of 2 through 15 with several correcting algorithms and for a Runga-Kutta integrator. Considering stability regions, choices were made for the optimally efficient integration modes for the DS elements. Integrating in these modes reduces computing costs for a specified accuracy.