Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh simplification, etc
ear-clipping 开源项目推荐(14 个)
ear-clipping 话题在 GitHub 上没有填写简介,这里按 Star 数汇总最相关的热门仓库。
热门项目 全部 14
GitHub 共 14 个仓库,已全部展示Fast polygon triangulation into triangle strips: ear clipping with a constrained Delaunay fallback for broken rings. Header-only C++17 and WebAssembly, with an earcut-compatible JavaScript call.
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh simplification, etc
Real-time mesh cutting in Unity using projection, "Ear Clipping", UV interpolation, and decal application.
构建命中框从未如此简单
Demonstrates how to triangulate a set of points using Ear Clipping with a sample OpenGL program.
Demo of Ear Clipping triangulation algorithm. Check out the project site.
基于WebGL2的3D渲染器 + EarClipping算法
Super lightweight ear-clipping 2D polygon triangulation package for Unity
📐 Geometry Uni Assignments
Ear clipping algorithm visualization
Polygon triangulation into triangle strips: a bit-exact Go port of earstrip (ear clipping + constrained Delaunay fallback)
Optimal ear clipping triangulation algorithm converting arbitrary simple non-convex 2D polygons with holes into valid triangular meshes in O(n^2).
Implementation of Ear Clipping Triangulation algorithm
关于这个话题
- 清单取自 GitHub 话题页并按 Star 数排序,每次展示前 14 个项目;原始页面见 https://github.com/topics/ear-clipping。
- 该话题在 GitHub 上共有 14 个仓库, 本站收录的是其中最热门的 14 个,不是全量列表。
- Star / Fork 每日自动刷新一次,实时数据以 GitHub 为准。
- 当前 14 个项目累计 1676 Star,覆盖 5 种主要语言,数据更新于 2026-11-07。
- 中文介绍来自 GitHub 官方话题说明(github/explore)的机器翻译,可点「查看原文」对照;译文缺失时会先展示原文。