"I love Geometry Central"

2022-08-07 15:57:00

Skip to content Geometry Central Home Initializing search nmwsharp/geometry-central Geometry Central nmwsharp/geometry-central Home Build Build Versions Building Dependencies Tests Tutorials Tutorials Load & navigate a mesh Basic Mutation Direction fields Surface Surface Surface Mesh Surface Mesh Basics Elements Boundaries Indexing Navigation and Iteration Containers Mutation Delta Complexes Internals Geometry Geometry Overview Quantities Utilities Utilities Simple Polygon Mesh I/O Surface Point Algorithms Algorithms Direction Fields Geodesic Distance Tracing Geodesic Paths Vector Heat Method Surface Centers Geodesic Centroidal Voronoi Tessellations Robust Geometry Flip Geodesics Parameterization Intrinsic Triangulations Intrinsic Triangulations Basics Common Subdivision Signposts Integer Coordinates Function Transfer Point Cloud Point Cloud Basics Geometry Algorithms Algorithms Heat distance & transport Utilities Utilities IO Sampling Numerical Numerical Matrix Types Linear Algebra Utilities Linear Solvers Utilities Utilities Miscellaneous Vector2 Vector3 Utilities for Eigen Interoperability Welcome to Geometry CentralGeometry-central is a modern C++ library of data structures and algorithms for geometry processing, with a particular focus on surface meshes.Features include:A polished surface mesh class, with efficient support for mesh modification, and a system of containers for associating data with mesh elements.Implementations of canonical geometric quantities on surfaces, ranging from normals and curvatures to tangent vector bases to operators from discrete differential geometry.A suite of powerful algorithms, including computing distances on surface, generating direction fields, and manipulating intrinsic Delaunay triangulations.A coherent set of sparse linear algebra tools, based on Eigen and augmented to automatically utilize better solvers if available on your system.Sample:// Load a meshstd::unique_ptr mesh;std::unique_ptr geometry;std::tie(mesh, geometry) = readSurfaceMesh("spot.obj"); // Compute vertex areasVertexData vertexAreas(*mesh);geometry->requireFaceAreas();for(Vertex v : mesh->vertices()) { double A = 0.; for(Face f : v.adjacentFaces()) { A += geometry->faceAreas[f] / v.degree(); } vertexAreas[v] = A;}For more, see the tutorials. To get started with the code, see building. Use the sample project to get started with a build system and a gui.A introductory talk on geometry-central was given at SGP 2020, check it out to get started: www.youtube.com/watch?v=mw5Xz9CFZ7ABindings & Plugins:Python: Potpourri3dGrasshopper/Rhino: Lionfish by Math WhittakerIf you’re interested in creating additional bindings/plugins, feel free to reach out!Related alternatives: CGAL,libIGL,OpenMesh,Polygon Mesh Processing Library,CinoLibCreditsGeometry-central is developed by Nicholas Sharp, with many contributions from Keenan Crane, Yousuf Soliman,Mark Gillespie,Rohan Sawhney, Chris Yu,and many others.If geometry-central contributes to an academic publication, cite it as:@misc{geometrycentral, title = {geometry-central}, author = {Nicholas Sharp and Keenan Crane and others}, note = {www.geometry-central.net}, year = {2019}}Development of this software was funded in part by NSF Award 1717320, an NSF graduate research fellowship, and gifts from Adobe Research and Autodesk, Inc. Next Versions Made with Material for MkDocs