Recovering the polyhedral geometry of fragments
Year: 2025
Type: article
Abstract: convex polyhedra having few faces and vertices, but these numbers carry vital geophysical information on the fragmentation process. Despite their significance, the identification of the number of faces and vertices of the ideal polyhedron has so far been carried out only through visual inspection. Here, we present an algorithm capable of performing this task in a reliable manner. The input of our algorithm is a 3D scan of the fragment which is a triangulated polyhedron with very large number of faces. Our algorithm performs a systematic simplification using the following steps:•Gaussian smoothing is performed on the spherical histogram of the 3D scans faces to identify the most important face orientations.•Planes carrying the faces of the ideal polyhedron are identified and the ideal polygon is reconstructed•Small faces are removed in a systematic manner We present two versions of the algorithm that we benchmarked the algorithm against a dataset of human measurements on 132 fragments. Beyond identifying the ideal polyhedral approximation for fragments, our method is also capable of tracing backward the shape evolution of rounded pebbles to their origins.
Source: MethodsX
Authors: János Török, Gábor Domokos
Institution: Budapest University of Technology and Economics
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $1,260
Award: G967628899
OpenAlex ID: W4410857786