Skip to content

Centroidal Voronoi Diagram of a mesh's surface using an iterative discrete clustering algorithm on graphs.

License

Notifications You must be signed in to change notification settings

rapfamily4/DiscretizedLloyd

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

62 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Discretized Lloyd's algorithm

CVD on the Standford bunny model. CVD on the hippo model; tangent field is shown.

This project presents an algorithm for computing Centroidal Voronoi Diagrams of a mesh's surface using a discrete clustering approach.

The algorithm is mainly inspierd by Lloyd's, and it only works by simple graph operations on a graph structure built from the input mesh. The resulting tessellation has its centroids points on the mesh's surface from the get-go, without any need to project them.

Compile

Linux / MacOS

Compile this project using the standard cmake routine:

mkdir build
cd build
cmake ..
make

Windows / Visual Studio 2022

Type the following commands in the prompt:

mkdir build
cd build
cmake .. -G "Visual Studio 17 2022"

About

Centroidal Voronoi Diagram of a mesh's surface using an iterative discrete clustering algorithm on graphs.

Topics

Resources

License

Stars

Watchers

Forks

Packages

No packages published