Bubble mesh: automated triangular meshing of non-manifold geometry by sphere packing

@inproceedings{Shimada1995BubbleMA,
  title={Bubble mesh: automated triangular meshing of non-manifold geometry by sphere packing},
  author={Kenji Shimada and David C. Gossard},
  booktitle={SMA '95},
  year={1995}
}
This paper presents a new computational method for fully automated triangular mesh generation, consistently applicable to wire-frame, surface, solid, and nonmanifold geometries. The method, called bubble rrzeshing, is based on the observation that a pattern of tightly packed spheres mimics a Voronoi diagram, from which a set of well-shaped Delaunay triangles and tetrahedral can be created by connecting the centers of the spheres. Given a domain geometry and a node-spacing function, spheres are… 
Meshes using Sphere Packing : Generation , Re nement and CoarseningGary
TLDR
A sphere-packing technique for Delaunay-based mesh generation, reenement and coarsening is presented and experimental evidence of the robustness of the CVM over a mesh with slivers is provided.
Triangular mesh generation on free-form surfaces based on bubble dynamics simulation
Purpose Modern CAD systems facilitate the creation of any surface geometry imaginable, and complex surfaces for free-form grid shells are often represented by a set of Non-Uniform Rational B-Splines
Control Volume Meshes Using Sphere Packing
  • G. Miller
  • Computer Science, Physics
    IRREGULAR
  • 1998
We present a sphere-packing technique for Delaunay-based mesh generation, refinement and coarsening. We have previously established that a bounded radius of ratio of circumscribed sphere to smallest
Nibble meshing: incremental triangulation of non-manifold solid boundary
An algorithm to mesh interconnected surfaces via the Voronoi interface
  • R. Saye
  • Physics
    Engineering with Computers
  • 2013
TLDR
An algorithm to generate high-quality triangulated meshes of a set of interconnected surfaces with high surface accuracy is presented, capitalising on mathematical aspects of a geometric construction known as the “Voronoi interface" to create a topologically consistent mesh automatically.
Quadrilateral Meshing with Directionality Control through the Packing of Square Cells
TLDR
This paper proposes a computational method that can create a quadrilateral mesh whose directionality is precisely controlled and generates a high quality mesh whose element sizes and mesh directionality conform well to the given input.
Tetrahedral Mesh Generation for Deformable Bodies
TLDR
A new tetrahedral mesh generation algorithm is proposed that produces both high quality elements and mesh that is well conditioned for subsequent large deformations, and is readily refined if deemed necessary during subsequent simulation.
Quadrilateral Meshing with Anisotropy and Directionality Control via Close Packing of Rectangular Cells
TLDR
The novelty of the method is that closely packed rectangles resemble a pattern of Voronoi polygons corresponding to a well-shaped quadrilateral mesh that conforms well to the input.
A Crystalline, Red Green Strategy for Meshing Highly Deformable Objects with Tetrahedra
TLDR
A new tetrahedral mesh generation algorithm is proposed that produces both high quality elements and a mesh that is well conditioned for subsequent large deformations, and is readily refined if deemed necessary during subsequent simulation.
...
...

References

SHOWING 1-10 OF 43 REFERENCES
Mesh relaxation: A new technique for improving triangulations
SUMMARY Given a list of points defining a domain boundary, a three-stage process is often used to triangulate a domain. First, an appropriate distribution of interior points is generated. Next the
An apporach to automatic three‐dimensional finite element mesh generation
TLDR
The purpose of this paper is to describe an interactive solid mesh generation system capable of generating valid meshes of well-proportional tetrahedral finite elements for the decomposition of multiply connected solid structures.
On good triangulations in three dimensions
TLDR
A number of algorithms exist fortriangulating a point set or a polyhedron in two and three dimensions, but few address the problem of guaranteeing the shape of the triangular elements.
Topological Structures for Geometric Modeling
TLDR
A non-two-manifold boundary geometric modeling topology representation is developed which allows the unified and simultaneous representation of wireframe, surface, and solid modeling forms, while featuring a representable range beyond what is achievable in any of the previous modeling forms.
A brief review of techniques for generating irregular computational grids
This review attempts to place in perspective the wide variety of computer methods which are available for constructing irregular computational grids. Several different approaches exist for each
Computational geometry: an introduction
TLDR
This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.
...
...