The convexhull-3d-implementation-of-incremental-convexhull-algorithm's intro from milasudril

milasudril / convexhull-3d-implementation-of-incremental-convexhull-algorithm Goto Github PK

View Code? Open in Web Editor NEW

c++ implementation of 3D incremental convell hull algorthim

License: Other

C++ 96.18% Makefile 3.82%

convexhull-3d-implementation-of-incremental-convexhull-algorithm's Introduction

Incremental 3D-Convexhull algorithm

This repository contains an C++ implementation of 3D ConvexHull algorithm from the book Computational Geometry in C by O'Rourke. This code is written using standard containers, together with GeoSIMD. The latter is used to store points.

Build and Run (text output only)

make
__targets_rel/src/convhull < data/bunny.obj > bunny_convhull.obj

Example Usage

// points can be converted into a
//
// span<convhull::point_3d const>;

convhull::builder builder{points};

std::ranges::for_each(points, [](auto const& item){
	printf("v %.8g %.8g %.8g\n", item[0], item[1], item[2]);
});

std::ranges::for_each(builder.faces(), [](auto const& item) {
	printf("f %u %u %u\n",
		item.vertices[0].value() + 1,
		item.vertices[1].value() + 1,
		item.vertices[2].value() + 1);
});