Simple MPL-2.0-licensed C++ geometry processing library.
This report summarizes scanner evidence for libigl/libigl, a C++ project with 5,105 GitHub stars. SynthScan examined 175,315 lines of code across 1616 source files, recording 1849 pattern matches distributed across 7 syntactic categories. The legacy adjusted pattern signal is 10.8 (Moderate pattern signal); it is not an authorship estimate.
Use the findings to ask whether maintainers can explain intent, verify dependencies, simplify unnecessary scaffolding, and focus review effort. Risk Payload v1 adds ownership, supply-chain, over-engineering, and review-effort vectors when available. These are prompts for human verification, not probabilities, security findings, or measured maintenance costs.
Use each vector to guide manual verification of the underlying findings.
Can maintainers explain intent, assumptions, and trade-offs? 1839 finding(s).
Are imports declared and package/API names verified? 10 finding(s).
Are wrappers, guards, and repeated structures necessary? 0 finding(s).
Which changes need focused human review? 1849 finding(s).
This chart tracks the legacy adjusted pattern score across scan runs. Changes can reflect source changes, scan coverage, or detector/scoring versions; they do not measure AI adoption or prove that a team refactored code. Compare runs only when their scoring versions are compatible. The dashed line tracks the raw pattern-hit count.
Groups findings by configured severity weight. Severity is not a confidence estimate, security rating, or proof that a package is missing. Verify imports against the project's manifests and inspect each finding in its local design context.
This horizontal bar chart shows where configured pattern scores accumulate across directories. Treat the bars as locations to inspect, not as evidence of authorship or code quality. Use the file-level findings to decide whether a directory needs a focused ownership, dependency, complexity, or review check.
The scanner identified 1849 distinct pattern matches across 7 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a detector match to inspect in context. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.
Reading the findings table: The Severity column indicates the configured finding weight (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — legacy comment-context matches receive a ×1.5 score weight. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier under the legacy scoring model.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | …rial/406_FastAutomaticSkinningTransformations/main.cpp | 1 | #include "precomputation.h" | COMMENT |
| LOW | tutorial/1006_ConstrainedDecimation/main.cpp | 1 | // 1006_ConstrainedDecimation | COMMENT |
| LOW | tutorial/1006_ConstrainedDecimation/main.cpp | 21 | // self-intersect); with the clearance decorator on, no collapse is allowed to | COMMENT |
| LOW | tutorial/704_SignedDistance/main.cpp | 1 | #include <igl/cat.h> | COMMENT |
| LOW | tutorial/707_SweptVolume/main.cpp | 1 | #include <igl/read_triangle_mesh.h> | COMMENT |
| LOW | tutorial/807_FastWindingNumber/main.cpp | 1 | #include <igl/fast_winding_number.h> | COMMENT |
| LOW | tutorial/1004_SplineDistance/main.cpp | 1 | #include <igl/opengl/glfw/Viewer.h> | COMMENT |
| LOW | tutorial/1001_LipschitzOctree/main.cpp | 1 | #include <igl/read_triangle_mesh.h> | COMMENT |
| LOW | tutorial/804_MarchingTets/main.cpp | 1 | #include <igl/opengl/glfw/Viewer.h> | COMMENT |
| LOW | tutorial/709_SLIM/param_2d_demo_iter.cpp | 1 | #include "param_2d_demo_iter.h" | COMMENT |
| LOW | tutorial/709_SLIM/main.cpp | 1 | #include "check_mesh_for_issues.h" | COMMENT |
| LOW | tutorial/901_VectorFieldSmoothing/main.cpp | 1 | #include <igl/read_triangle_mesh.h> | COMMENT |
| LOW | tutorial/405_AsRigidAsPossible/main.cpp | 1 | #include <igl/colon.h> | COMMENT |
| LOW | tutorial/403_BoundedBiharmonicWeights/main.cpp | 1 | #include <igl/boundary_conditions.h> | COMMENT |
| LOW | tutorial/403_BoundedBiharmonicWeights/main.cpp | 121 | // compute BBW weights matrix | COMMENT |
| LOW | tutorial/203_CurvatureDirections/main.cpp | 1 | #include <igl/avg_edge_length.h> | COMMENT |
| LOW | tutorial/902_VectorParallelTransport/main.cpp | 1 | #include <igl/read_triangle_mesh.h> | COMMENT |
| LOW | tutorial/303_LaplaceEquation/main.cpp | 1 | #include <igl/boundary_facets.h> | COMMENT |
| LOW | tutorial/810_BlueNoise/main.cpp | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | tutorial/703_Decimation/main.cpp | 1 | #include <igl/circulation.h> | COMMENT |
| LOW | tutorial/910_OrientedBoundingBox/main.cpp | 1 | #include <igl/read_triangle_mesh.h> | COMMENT |
| LOW | tutorial/504_Planarization/main.cpp | 1 | #include <igl/avg_edge_length.h> | COMMENT |
| LOW | tutorial/205_Laplacian/main.cpp | 1 | #include <igl/barycenter.h> | COMMENT |
| LOW | tutorial/407_BiharmonicCoordinates/main.cpp | 1 | #include <igl/opengl/gl.h> | COMMENT |
| LOW | tutorial/407_BiharmonicCoordinates/main.cpp | 61 | assert(sqrD.minCoeff() < 1e-7 && "low.V should exist in high.V"); | COMMENT |
| LOW | tutorial/710_SCAF/main.cpp | 1 | #include <igl/triangle/scaf.h> | COMMENT |
| LOW | tutorial/907_DynamicAABB/main.cpp | 1 | #include <igl/AABB.h> | COMMENT |
| LOW | tutorial/604_Triangle/main.cpp | 21 | COMMENT | |
| LOW | tutorial/1005_SubtriangleGeodesicDistances/main.cpp | 1 | #include <igl/read_triangle_mesh.h> | COMMENT |
| LOW | tutorial/404_DualQuaternionSkinning/main.cpp | 1 | #include <igl/directed_edge_orientations.h> | COMMENT |
| LOW | tutorial/1007_LazyCage/main.cpp | 1 | // 1007_LazyCage | COMMENT |
| LOW | tutorial/1007_LazyCage/main.cpp | 21 | // With no --grid, the isosurfacing resolution is chosen automatically from the | COMMENT |
| LOW | tutorial/908_IntersectionBlockingDecimation/main.cpp | 1 | #include <igl/opengl/glfw/Viewer.h> | COMMENT |
| LOW | tutorial/602_Matlab/main.cpp | 1 | COMMENT | |
| LOW | tutorial/802_DataSmoothing/main.cpp | 1 | #include <igl/read_triangle_mesh.h> | COMMENT |
| LOW | tutorial/805_MeshImplicitFunction/contours.cpp | 1 | #include "contours.h" | COMMENT |
| LOW | tutorial/809_ExplodedView/main.cpp | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | tutorial/304_LinearEqualityConstraints/main.cpp | 1 | #include <igl/boundary_facets.h> | COMMENT |
| LOW | tutorial/808_IterativeClosestPoint/main.cpp | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | tutorial/1002_EytzingerAABB/main.cpp | 1 | #include <igl/read_triangle_mesh.h> | COMMENT |
| LOW | tutorial/803_ShapeUp/main.cpp | 1 | #include <igl/avg_edge_length.h> | COMMENT |
| LOW | tutorial/601_Serialization/main.cpp | 21 | this->Add(V , "V"); | COMMENT |
| LOW | tutorial/601_Serialization/main.cpp | 41 | // { | COMMENT |
| LOW | …l/Singular_Value_Decomposition_Kernel_Declarations.hpp | 1 | //##################################################################### | COMMENT |
| LOW | …l/Singular_Value_Decomposition_Kernel_Declarations.hpp | 21 | #ifdef PRINT_DEBUGGING_OUTPUT | COMMENT |
| LOW | …l/Singular_Value_Decomposition_Kernel_Declarations.hpp | 41 | #ifdef USE_AVX_IMPLEMENTATION | COMMENT |
| LOW | include/igl/NormalType.h | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | include/igl/lscm.h | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | include/igl/lscm.h | 21 | /// Generation" [Lévy et al. 2002]), though this implementation follows the | COMMENT |
| LOW | include/igl/moments.h | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | include/igl/loop.cpp | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | include/igl/is_dir.h | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | include/igl/shapeup.cpp | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | include/igl/comb_frame_field.h | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | include/igl/MshLoader.h | 1 | // based on MSH reader from PyMesh | COMMENT |
| LOW | include/igl/trackball.h | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | include/igl/unzip_corners.h | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | include/igl/unzip_corners.h | 21 | /// | COMMENT |
| LOW | include/igl/cubic_split.h | 1 | #ifndef IGL_CUBIC_SPLIT_H | COMMENT |
| LOW | include/igl/FileMemoryStream.h | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| 1759 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | include/igl/WindingNumberAABB.h | 259 | //// Perfect matching is **not** robust | COMMENT |
| MEDIUM | include/igl/arap.h | 108 | /// a map to the position data, allowing seamless interoperability with user-defined | COMMENT |
| MEDIUM | include/igl/tri_tri_intersect.cpp | 618 | // Alec: it's hard to believe this will ever be perfectly robust, but checking | COMMENT |
| MEDIUM | include/igl/harmonic.cpp | 130 | // This is **not** robust for k>2. See KKT system in [Jacobson et al. 2010] | COMMENT |
| MEDIUM | include/igl/flipped_triangles.cpp | 24 | // https://www.cs.cmu.edu/~quake/robust.html | COMMENT |
| MEDIUM | include/igl/sort_angles.h | 15 | /// Sort angles in ascending order in a numerically robust way. | COMMENT |
| MEDIUM⚡ | include/igl/project_to_halfspace_intersection.cpp | 88 | // D=3 -> 2: branchless orthonormal-basis construction, robust for any | COMMENT |
| MEDIUM⚡ | include/igl/project_to_halfspace_intersection.cpp | 91 | // Revisited" (JCGT 2017) -- this is the standard fast/robust technique | COMMENT |
| MEDIUM⚡ | include/igl/project_to_halfspace_intersection.cpp | 92 | // and satisfies the spec's "robust fallback axis selection" requirement | COMMENT |
| MEDIUM | include/igl/seam_edges.cpp | 43 | // Based on: https://www.cs.cmu.edu/~quake/robust.html | COMMENT |
| MEDIUM | include/igl/copyleft/cgal/outer_facet.h | 29 | /// function is more robust because it does not rely on facet normals. | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | include/igl/triangle/scaf.h | 23 | /// For a complete implementation and customized UI, please refer to https://github.com/jiangzhongshi/scaffold-map | COMMENT |
| MEDIUM | include/igl/triangle/scaf.h | 32 | /// scaffold + isometric | COMMENT |
| MEDIUM | include/igl/triangle/scaf.h | 47 | /// scaffold domain tets: scaffold tets | COMMENT |
| MEDIUM | include/igl/triangle/scaf.h | 53 | /// scaffold area or volume | COMMENT |
| MEDIUM | include/igl/triangle/scaf.h | 122 | /// @param[in] whole: Include scaffold if true | COMMENT |
| MEDIUM | include/igl/triangle/scaf.cpp | 525 | // x_e as the fixed frame, x_u for unknowns (mesh + unknown scaffold) | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW⚡ | tests/include/igl/writePLY.cpp | 24 | Vheader1.push_back("dummy_data"); | CODE |
| LOW⚡ | tests/include/igl/writePLY.cpp | 25 | Eigen::VectorXd dummy_data(V1.rows()); | CODE |
| LOW⚡ | tests/include/igl/writePLY.cpp | 27 | dummy_data(i)=(double)i; | CODE |
| LOW⚡ | tests/include/igl/writePLY.cpp | 29 | VD2<<VD1,dummy_data; | CODE |
| LOW | tests/include/igl/writePLY.cpp | 100 | REQUIRE (Vheader[2] == "dummy_data" ); | CODE |
| LOW⚡ | tests/include/igl/writePLY.cpp | 144 | Vheader1.push_back("dummy_data"); | CODE |
| LOW⚡ | tests/include/igl/writePLY.cpp | 145 | Eigen::VectorXf dummy_data(V1.rows()); | CODE |
| LOW⚡ | tests/include/igl/writePLY.cpp | 147 | dummy_data(i)=(double)i; | CODE |
| LOW⚡ | tests/include/igl/writePLY.cpp | 149 | VD2<<VD1,dummy_data; | CODE |
| LOW | tests/include/igl/writePLY.cpp | 187 | REQUIRE (Vheader[2] == "dummy_data" ); | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | include/igl/raytri.c | 11 | // Alec: I've added an include guard, made all functions inline and added | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | tutorial/602_Matlab/main.cpp | 54 | // Plot the size of EV (only for demonstration purposes) | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | include/igl/signed_distance.h | 262 | /// #### Usage: | COMMENT |