A rapid approximate algorithm for computing the areas/volumes of the cells in weakly inhomogeneous Voronoi diagram

MaRDI QIDQ3109082zbMATH OpenFDO

Authors Le Fang, Jieying Hong

Publication date 27 January 2012

zbMATH Keywords

fluid mechanicsVoronoi diagram

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Numerical quadrature and cubature formulas (65D32) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A fast robust algorithm for computing discrete Voronoi diagrams
• An iterative algorithm for computing measures of generalized Voronoi regions
• APPROXIMATION OF A TESSELLATION OF THE PLANE BY A VORONOI DIAGRAM
• An algorithm for \(L_p\)-Voronoi diagram construction on discrete grid in 2D
• Stable marker-particle method for the Voronoi diagram in a flow field

Cited in

(1)

• Error analysis of approximate operators for a particle method based on Voronoi diagram

This page was built for publication: A rapid approximate algorithm for computing the areas/volumes of the cells in weakly inhomogeneous Voronoi diagram

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