base.camp
Department of Informaticsbase.camp
Comparison of Concave Hull Algorithms
11 December 2024, by Anton Semjonov
Photo: base.camp
Concave hulls, unlike convex hulls, can more accurately represent datasets by including dents, cavities, or holes, making them valuable for applications like Geographical Information Systems and rockfill engineering. This project focuses on datasets with uniform spacing between points, comparing two algorithms—an adapted version from Park and Oh, and the χ-Shape algorithm from Duckham et al.—to determine the best approach for capturing geometric characteristics in such datasets.
