In this article, we propose a three-dimensional meshing algorithm for discrete models combining the lattice approach with the polyhedral particle approach. Our aim is to be able to leverage readily available, well-supported meshers to handle various geometries. We use them to generate a tetrahedral mesh, which our mesher then converts to a polyhedral mesh. The input mesh serves as geometrical support to generate the nodes of the discrete mesh. The desired shape is obtained with an assembly of convex polyhedral particles—without having to clip them. We show that this approach enables meshing convex or concave geometries with sharp edges, curved features, and more. Several three-dimensional geometries are presented to support this claim and illustrate the capabilities of the mesher. We provide a detailed analysis of its isotropy. The geometric isotropy is studied by analyzing the orientation of the generated beams. The mechanical isotropy is verified by assessing the properties of the elasticity tensor. Finally, we show that the new mesh retains its ability to be a good support for the generation of realistic cracking patterns.