On the Equivalence of the Digital Waveguide and Finite Difference Time Domain Schemes

It is known that the digital waveguide (DW) method for solving the wave equation numerically on a grid can be manipulated into the form of the standard finite-difference time-domain (FDTD) method (also known as the ``leapfrog'' recursion). This paper derives a simple rule for going in the other direction, that is, converting the state variables of the FDTD recursion to corresponding wave variables in a DW simulation. Since boundary conditions and initial values are more intuitively transparent in the DW formulation, the simple means of converting back and forth can be useful in initializing and constructing boundaries for FDTD simulations.Comment: v1: 6 pages; v2: 7 pages, generally more polished, more examples, expanded discussion; v3: 15 pages, added state space formulation, analysis of inputs and boundary conditions, translation of passive boundary conditions; v4: various typos fixe

Conforming restricted Delaunay mesh generation for piecewise smooth complexes

A Frontal-Delaunay refinement algorithm for mesh generation in piecewise smooth domains is described. Built using a restricted Delaunay framework, this new algorithm combines a number of novel features, including: (i) an unweighted, conforming restricted Delaunay representation for domains specified as a (non-manifold) collection of piecewise smooth surface patches and curve segments, (ii) a protection strategy for domains containing curve segments that subtend sharply acute angles, and (iii) a new class of off-centre refinement rules designed to achieve high-quality point-placement along embedded curve features. Experimental comparisons show that the new Frontal-Delaunay algorithm outperforms a classical (statically weighted) restricted Delaunay-refinement technique for a number of three-dimensional benchmark problems.Comment: To appear at the 25th International Meshing Roundtabl