A new algorithm for three-dimensional Voronoi tessellation

DOI10.1016/0021-9991(83)90087-6zbMATH Open0529.05016OpenAlexW1989373517MaRDI QIDQ787149FDOQ787149

Tohru Ogawa, Masaharu Tanemura, Naofumi Ogita

Publication date: 1983

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9991(83)90087-6

zbMATH Keywords

Voronoi tessellationDelaunay tetrahedraVoronoi polytope

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Algorithms in computer science (68W99)

Cites Work

• Computing Dirichlet Tessellations in the Plane
• Title not available (Why is that?)
• Construction of Voronoi polyhedra
• A procedure for the construction of Voronoi polyhedra

Cited In (27)

• Effective conductive properties of open-cell foams
• Mechanical properties of open cell foams: Simulations by Laguerre tesselation procedure
• Title not available (Why is that?)
• Modelling Heterogeneous Space–Time Occurrences of Earthquakes and its Residual Analysis
• Node-based parallel computing of three-dimensional incompressible flows using the free mesh method
• Higher-dimensional Voronoi diagrams in linear expected time
• Adaptive higher-order phase-field modeling of anisotropic brittle fracture in 3D polycrystalline materials
• About the Delaunay-Voronoi tesselation
• Brittle fracture in polycrystalline microstructures with the extended finite element method
• Variational Delaunay approach to the generation of tetrahedral finite element meshes
• The atomic strain tensor
• A comparison of sequential Delaunay triangulation algorithms.
• Rapid and accurate computation of the distance function using grids
• Local stress calculation in simulations of multicomponent systems
• On the construction of the Voronoi mesh on a sphere
• Three-dimensional random Voronoi tessellations: from cubic crystal lattices to Poisson point processes
• About the time evolving Voronoi tessellation
• The algorithm for three-dimensional Voronoi polyhedra
• Dynamics of a single particle moving on a random Lorentz lattice-gas
• A FEM-BASED MESHFREE METHOD WITH A PROBABILISTIC NODE GENERATION TECHNIQUE
• A three-dimensional vertex dynamics cell model of space-filling polyhedra simulating cell behavior in a cell aggregate
• Parallel unstructured grid generation
• Phase-field modeling of brittle fracture in a 3D polycrystalline material via an adaptive isogeometric-meshfree approach
• Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation
• Breakthrough `workarounds' in unstructured mesh generation
• A multigrid method with unstructured adaptive grids for steady Euler equations
• From symmetry breaking to Poisson point process in 2D Voronoi tessellations: the generic nature of hexagons

This page was built for publication: A new algorithm for three-dimensional Voronoi tessellation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q787149)