The space-time conservation element and solution element (CE/SE) method is used to solve the conservation law form of the compressible axisymmetric Navier-Stokes equations. The equations are time marched to predict the unsteady flow and the near-field screech tone noise issuing from an underexpanded circular jet. The CE/SE method uses an unstructured grid based data structure. The unstructured ...

The space-time conservation element and solution element (CE/SE) method is used to solve the conservation law form of the compressible axisymmetric Navier-Stokes equations. The equations are time marched to predict the unsteady flow and the near-field screech tone noise issuing from an underexpanded circular jet. The CE/SE method uses an unstructured grid based data structure. The unstructured ...

Overset grids resolve complicated geometries by creating high quality structured grids that are independently built for each component. This simplifies the process of grid generation, but domain connectivity must be performed so that adjacent grids share information. Shortcomings of the current X-rays method for the hole-cutting step of domain connectivity were explored to automate the X-rays a...

This article aims to establish the relationship between philosopher Maurice Merleau-Ponty and artist Robert Delaunay regarding corporeality visibility of work art. These notions are developed by in his text The eye spirit together with theory inobjective art Delaunay, expressed From cubism . Moreover, explicitly refers this text, so it is possible outline a correspondence both, especially, thei...

An irregular lattice model is proposed for simulating quasistatic fracture in softening materials. Lattice elements are defined on the edges of a Delaunay tessellation of the medium. The dual sVoronoid tessellation is used to scale the elemental stiffness terms in a manner that renders the lattice elastically homogeneous. This property enables the accurate modeling of heterogeneity, as demonstr...

This paper presents in detail how the techniques described in my previous work [Kallmann et al., 2003] can be used for efficiently computing collision-free paths in a triangulated planar environment. The method is based on a dynamic Constrained Delaunay Triangulation (CDT) where constraints are the obstacles in the planar environment. The main advantage of relying on a triangulated domain is th...

This paper introduces a modification of our original Delaunay-based optimization algorithm (developed in JOGO DOI: 10.1007/s10898-015-0384-2) that reduces the number of function evaluations on the boundary of feasibility as compared with the original algorithm. A weaknesses we have identified with the original algorithm is the sometimes faulty behavior of the generated uncertainty function near...

We describe an algorithm to construct an intrinsic Delaunay triangulation of a smooth closed submanifold of Euclidean space. Using results established in a companion paper on the stability of Delaunay triangulations on δ-generic point sets, we establish sampling criteria which ensure that the intrinsic Delaunay complex coincides with the restricted Delaunay complex and also with the recently in...

We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of δ-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay triangulations under perturbations of the metric and of the vertex positions. We quantify the magnitude of the perturbations under which the Delaunay triangulation r...