Linear-Size Meshes
نویسندگان
چکیده
Most modern meshing algorithms produce asymptotically optimal size output. However, the size of the optimal mesh may not be bounded by any function of n. In this paper, we introduce well-paced point sets and prove that these will produce linear size outputs when meshed with any “size-optimal” meshing algorithm. This work generalizes all previous work on the linear cost of balancing quadtrees. We also present an algorithm that uses well-paced points to produce a linear size Delaunay mesh of a point set in R.
منابع مشابه
Convergence rate of a finite volume scheme for the linear convection-diffusion equation on locally refined meshes
We study a finite volume method, used to approximate the solution of the linear two dimensional convection diffusion équation, with mixed Dirichlet and Neumann boundary conditions, on Cartesian meshes refined by an automatic technique (which leads to meshes with hanging nodes). We propose an analysis through a discrete variational approach, in a discrete H finite volume space. We actually prove...
متن کاملSize complexity of volume meshes vs. surface meshes
Typical volume meshes in three dimensions are designed to conform to an underlying two-dimensional surface mesh, with volume mesh element size growing larger away from the surface. The surface mesh may be uniformly spaced or highly graded, and may have fine resolution due to extrinsic mesh size concerns. When we desire that such a volume mesh have good aspect ratio, we require that some space-f...
متن کاملSelf-Timed Meshes Are Faster Than Synchronous
This paper shows that self-timed meshes can achieve linear speed-up. The per-processor performance of a mesh is the average number of operations per processor per unit time. For synchronous processors, it has been shown that the per-processor performance of a mesh goes to zero as the size of the mesh goes to infinity. This paper shows that for self-timed meshes, the per-processor performance ca...
متن کاملMesh Generation for Implicit Geometries
We present new techniques for generation of unstructured meshes for geometries specified by implicit functions. An initial mesh is iteratively improved by solving for a force equilibrium in the element edges, and the boundary nodes are projected using the implicit geometry definition. Our algorithm generalizes to any dimension and it typically produces meshes of very high quality. We show a sim...
متن کاملNative mesh ordering with Scotch 4.0
Sparse matrix reordering is a key issue for the the efficient factorization of sparse symmetric matrices, not only to reduce fill-in and operation count, but also to increase concurrency in the elimination tree, which is essential to achieve high speed-ups when solving the systems on parallel architectures. Most sparse matrix reordering software, when applied to finite-element or finite-volume ...
متن کامل