Voronoi Diagram Generation in MATLAB with Distance-Constrained Seed Points

This program generates Voronoi diagrams in MATLAB. Voronoi diagrams represent a method for triangulating discrete point sets on a plane, producing adjacent triangles where each triangle's circumcircle contains no other discrete points. The implementation utilizes MATLAB's built-in voronoi() function combined with custom distance validation algorithms. When using this program, you can generate random seed points while enforcing minimum distance constraints between points through iterative coordinate generation and Euclidean distance checks. This ensures the mathematical validity of the resulting Voronoi tessellation. The program outputs two key datasets: seed point coordinates (stored in matrix format) and corresponding vertex coordinates (organized as cell arrays for polygonal regions). These outputs are formatted for direct import into ABAQUS, facilitating accurate geometric modeling. Through Voronoi-based triangulation, you can achieve precise spatial discretization for finite element analysis, enhancing simulation reliability by maintaining proper mesh geometry and adjacency relationships. The code includes error handling for degenerate cases and provides visualization options through MATLAB's plotting functions.