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

zbMATH Open1240.05290MaRDI QIDQ3109082FDOQ3109082

Authors: Le Fang, Jieying Hong 

Publication date: 27 January 2012

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

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)

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)