Simple MPL-2.0-licensed C++ geometry processing library.
This report presents the forensic synthetic code analysis of libigl/libigl, a C++ project with 5,078 GitHub stars. SynthScan v2.0 examined 170,426 lines of code across 1587 source files, recording 1795 pattern matches distributed across 7 syntactic categories. The overall adjusted score of 10.7 places this repository in the Low AI signal band.
The scanner applied 160+ deterministic lexical heuristics, multi-line block detectors, abstract syntax tree depth profilers, and a cross-file Jaccard similarity matrix to construct a statistically normalised synthetic code estimate. All matches are individually weighted by severity coefficient and contextual multiplier before summation, and the resulting headline score is temporally discounted to account for the repository's development history relative to the commercial emergence of large language model coding tooling (November 2022 onward).
Longitudinal tracking requires multiple scan runs. Once this repository is re-scanned after new commits land, this chart will visualise how the synthetic code signal evolves over time — enabling you to detect whether AI authorship is growing, stabilising, or being actively corrected by human engineers.
Classifies detected patterns by their diagnostic confidence and structural impact. CRITICAL patterns (coefficient 10) represent definitive synthetic signatures — hallucinated imports, explicit LLM attribution metadata — virtually never produced by human authors. HIGH (5) indicates strong structural tells such as cross-file repetition or cross-linguistic idioms. MEDIUM (2) covers recognisable conversational padding and AI-specific vocabulary. LOW (1) captures subtle indicators like tautological comments and generic boilerplate that require density to carry independent signal.
This horizontal bar chart decomposes the repository's raw synthetic code score by top-level directory, allowing you to pinpoint precisely which modules or components carry the highest AI authorship density. Directories with disproportionately high scores relative to their size warrant targeted manual review: concentrated AI signatures often trace back to mass-generated configuration layers, auto-ported test suites, LLM-scaffolded boilerplate classes, or entire subsystems authored under heavy copilot assistance. Use this view to prioritise your human code-review effort.
The scanner identified 1795 distinct pattern matches across 7 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a statistically significant AI authorship indicator. 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 diagnostic confidence level (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — comment-context matches receive a ×1.5 weight because LLMs systematically over-annotate. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier as dense clusters constitute far stronger evidence of synthetic authorship than isolated hits.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | …rial/406_FastAutomaticSkinningTransformations/main.cpp | 1 | #include "precomputation.h" | 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/404_DualQuaternionSkinning/main.cpp | 1 | #include <igl/directed_edge_orientations.h> | 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 |
| LOW | include/igl/SolverStatus.h | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | include/igl/tan_half_angle.h | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | include/igl/circulation.h | 1 | // This file is part of libigl, a simple c++ geometry processing library. | COMMENT |
| LOW | include/igl/circulation.h | 21 | /// E(e,1)) | COMMENT |
| LOW | include/igl/circulation.h | 41 | /// @param[in] e index into E of edge to circulate | COMMENT |
| 1708 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/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 |