Geometric Rounding and Feature Separation in Meshes

Geometric rounding of a mesh is the task of approximating its vertex coordinates by floating point numbers while preserving mesh structure. Geometric rounding allows algorithms of computational geometry to interface with numerical algorithms. We present a practical geometric rounding algorithm for 3D triangle meshes that preserves the topology of the mesh. The basis of the algorithm is a novel strategy: 1) modify the mesh to achieve a feature separation that prevents topology changes when the coordinates change by the rounding unit; and 2) round each vertex coordinate to the closest floating point number. Feature separation is also useful on its own, for example for satisfying minimum separation rules in CAD models. We demonstrate a robust, accurate implementation

Hypercube algorithms on mesh connected multicomputers

A new methodology named CALMANT (CC-cube Algorithms on Meshes and Tori) for mapping a type of algorithm that we call CC-cube algorithm onto multicomputers with hypercube, mesh, or torus interconnection topology is proposed. This methodology is suitable when the initial problem can be expressed as a set of processes that communicate through a hypercube topology (a CC-cube algorithm). There are many important algorithms that fit into the CC-cube type. CALMANT is based on three different techniques: (a) the standard embedding to assign the processes of the algorithm to the nodes of the mesh multicomputer; (b) the communication pipelining technique to increase the level of communication parallelism inherent in the CC-cube algorithms; and (c) optimal message-scheduling algorithms proposed in this work in order to avoid conflicts and minimizing in this way the communication time. Although CALMANT is proposed for multicomputers with different interconnection network topologies, the paper only focuses on the particular case of meshes.Peer ReviewedPostprint (published version

The KW-boundary hybrid digital waveguide mesh for room acoustics applications

The digital waveguide mesh is a discrete-time simulation used to model acoustic wave propagation through a bounded medium. It can be applied to the simulation of the acoustics of rooms through the generation of impulse responses suitable for auralization purposes. However, large-scale three-dimensional mesh structures are required for high quality results. These structures must therefore be efficient and also capable of flexible boundary implementation in terms of both geometrical layout and the possibility for improved mesh termination algorithms. The general one-dimensional N-port boundary termination is investigated, where N depends on the geometry of the modeled domain and the mesh topology used. The equivalence between physical variable Kirchoff-model, and scattering-based wave-model boundary formulations is proved. This leads to the KW-hybrid one-dimensional N-port boundary-node termination, which is shown to be equivalent to the Kirchoff- and wave-model cases. The KW-hybrid boundary-node is implemented as part of a new hybrid two-dimensional triangular digital waveguide mesh. This is shown to offer the possibility for large-scale, computationally efficient mesh structures for more complex shapes. It proves more accurate than a similar rectilinear mesh in terms of geometrical fit, and offers significant savings in processing time and memory use over a standard wave-based model. The new hybrid mesh also has the potential for improved real-world room boundary simulations through the inclusion of additional mixed modeling algorithms

An advancing front Delaunay triangulation algorithm designed for robustness

A new algorithm is described for generating an unstructured mesh about an arbitrary two-dimensional configuration. Mesh points are generated automatically by the algorithm in a manner which ensures a smooth variation of elements, and the resulting triangulation constitutes the Delaunay triangulation of these points. The algorithm combines the mathematical elegance and efficiency of Delaunay triangulation algorithms with the desirable point placement features, boundary integrity, and robustness traditionally associated with advancing-front-type mesh generation strategies. The method offers increased robustness over previous algorithms in that it cannot fail regardless of the initial boundary point distribution and the prescribed cell size distribution throughout the flow-field

Unstructured mesh algorithms for aerodynamic calculations

The use of unstructured mesh techniques for solving complex aerodynamic flows is discussed. The principle advantages of unstructured mesh strategies, as they relate to complex geometries, adaptive meshing capabilities, and parallel processing are emphasized. The various aspects required for the efficient and accurate solution of aerodynamic flows are addressed. These include mesh generation, mesh adaptivity, solution algorithms, convergence acceleration, and turbulence modeling. Computations of viscous turbulent two-dimensional flows and inviscid three-dimensional flows about complex configurations are demonstrated. Remaining obstacles and directions for future research are also outlined

Incremental Visual-Inertial 3D Mesh Generation with Structural Regularities

Visual-Inertial Odometry (VIO) algorithms typically rely on a point cloud representation of the scene that does not model the topology of the environment. A 3D mesh instead offers a richer, yet lightweight, model. Nevertheless, building a 3D mesh out of the sparse and noisy 3D landmarks triangulated by a VIO algorithm often results in a mesh that does not fit the real scene. In order to regularize the mesh, previous approaches decouple state estimation from the 3D mesh regularization step, and either limit the 3D mesh to the current frame or let the mesh grow indefinitely. We propose instead to tightly couple mesh regularization and state estimation by detecting and enforcing structural regularities in a novel factor-graph formulation. We also propose to incrementally build the mesh by restricting its extent to the time-horizon of the VIO optimization; the resulting 3D mesh covers a larger portion of the scene than a per-frame approach while its memory usage and computational complexity remain bounded. We show that our approach successfully regularizes the mesh, while improving localization accuracy, when structural regularities are present, and remains operational in scenes without regularities.Comment: 7 pages, 5 figures, ICRA accepte

Optimal Point Placement for Mesh Smoothing

We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using generalized linear programming. We also give efficient algorithms for some mesh smoothing problems that do not fit into the generalized linear programming paradigm.Comment: 12 pages, 3 figures. A preliminary version of this paper was presented at the 8th ACM/SIAM Symp. on Discrete Algorithms (SODA '97). This is the final version, and will appear in a special issue of J. Algorithms for papers from SODA '9

Adaptive Mesh Refinement for Storm Surge

An approach to utilizing adaptive mesh refinement algorithms for storm surge modeling is proposed. Currently numerical models exist that can resolve the details of coastal regions but are often too costly to be run in an ensemble forecasting framework without significant computing resources. The application of adaptive mesh refinement algorithms substantially lowers the computational cost of a storm surge model run while retaining much of the desired coastal resolution. The approach presented is implemented in the \geoclaw framework and compared to \adcirc for Hurricane Ike along with observed tide gauge data and the computational cost of each model run

Diagnosing numerical Cherenkov instabilities in relativistic plasma simulations based on general meshes

Numerical Cherenkov radiation (NCR) or instability is a detrimental effect frequently found in electromagnetic particle-in-cell (EM-PIC) simulations involving relativistic plasma beams. NCR is caused by spurious coupling between electromagnetic-field modes and multiple beam resonances. This coupling may result from the slow down of poorly-resolved waves due to numerical (grid) dispersion and from aliasing mechanisms. NCR has been studied in the past for finite-difference-based EM-PIC algorithms on regular (structured) meshes with rectangular elements. In this work, we extend the analysis of NCR to finite-element-based EM-PIC algorithms implemented on unstructured meshes. The influence of different mesh element shapes and mesh layouts on NCR is studied. Analytic predictions are compared against results from finite-element-based EM-PIC simulations of relativistic plasma beams on various mesh types.Comment: 31 pages, 20 figure