Our Innovative Algorithms

Mesh Healing

Mesh healing is a critical process to prepare mesh for further use in the 3D pipeline, ensuring that mesh models are watertight, error-free, and suitable for applications such as s...

Discover more

Mesh Offsetting

Mesh offsetting enables the precise expansion or contraction of a 3D mesh surface, crucial for applications requiring exact wall thickness and custom surface control, like 3D print...

Discover more

Collision Detection

Collision detection serves as a fundamental concept in computational geometry. In this capacity, it focuses on determining whether two or more objects intersect. Understandably, be...

Discover more

File Formats

With MeshLib’s flexible file format support, users can seamlessly integrate 3D models into various workflows for further processing and analysis.

Discover more

3D Boolean

3D boolean operations are essential for creating complex shapes and forms that would be difficult or time-consuming to model from scratch using traditional modeling techniques.

Discover more

Mesh Boolean

The term ‘Mesh Boolean operations’ refers to a particular set of manipulations that professionals apply to pairs of versatile 3D objects for the purpose of reshaping their geometri...

Discover more

Point Cloud to Mesh

Point cloud triangulation is the process of triangulating a point cloud— a set of 3D points captured by LiDAR or other scanning technologies—into a continuous triangular mesh.

Discover more

Mesh Simplification

Mesh simplification (aka mesh decimation) is, for all intents and purposes, a technique aimed at reducing the number of triangles in 3D models.

Discover more

Mesh Triangulation

Mesh triangulation is a technique that swiftly converts point clouds into triangle meshes. In many cases, this process relies on pre-existing vertex normals to guide processes.

Discover more

CT Reconstruction

CT 3D reconstruction is the process of converting a series of 2D CT scans captured from different angles into 3D volumes. In practice, it suggests combining multiple X-ray images t...

Discover more

ICP: Iterative Closest Point

Iterative Closest Point (ICP) is, effectively, an algorithm that aligns two given 3D datasets. It takes a source object, i.e., a point cloud or a mesh, and estimates a rigid transf...

Discover more

3D Viewer

3D Viewer SDK is MeshLib’s plug-in rendering and UI layer. Written entirely in modern C++, this compact Viewer engine opens a window, draws your geometry, and presents a ribbon-sty...

Discover more

Mesh Smoothing

Mesh smoothing refers to a group of algorithms, some iterative and some none-iterative, designed to reposition vertices in a 3D model to reduce noise and improve surface quality. W...

Discover more

3D Volume Rendering

Volume rendering is a potent technique for visualizing volumetric data—that obtained from scanning—by mapping each voxel’s density to specific colors and opacities. In this fashion...

Discover more

Mesh to SDF

Signed Distance Fields (SDFs or distance volumes) are scalar fields most often stored as 3D voxel grids. Each voxel here records the shortest or unsigned or signed distance to a ta...

Discover more

Mesh Intersection

Mesh intersection computes the exact common volume shared by two polygonal models. Its potential, is applied to 3D data processing, computational geometry, and computer graphics. N...

Discover more

Fill Holes in Meshes

Filling holes in a mesh is a function that lets you correct topological defects, predictably known as holes. These defects are essentially missing regions where a continuous surfac...

Discover more