geometry-algorithm-library
Implement computational geometry algorithms
它会碰到什么
扫了多少2 个文本文件，2 KB
它会碰到什么不碰外部（只输出文字）
命中总数0 处
命中统计严重 0 · 高 0 · 中 0 · 低 0
这一栏是扫描器报的事实，不是结论。命中多不等于有毒（安全工具、规则库、示例脚本本来就会包含危险写法），命中少也不等于干净。它和你手上的凭据、文件、网络有什么关系，需要你自己看。
技能内容
Geometry Algorithm Library Skill
Purpose
Implement computational geometry algorithms for competitive programming and algorithmic problems.
Capabilities
- Convex hull (Graham scan, Andrew's monotone chain)
- Line intersection algorithms
- Closest pair of points
- Point in polygon tests
- Voronoi diagram, Delaunay triangulation
- Polygon clipping
Target Processes
- computational-geometry
Algorithm Catalog
Convex Hull
- Graham scan O(n log n)
- Andrew's monotone chain O(n log n)
- Jarvis march O(nh)
Intersection Algorithms
- Line sweep for segment intersection
- Bentley-Ottmann algorithm
- Polygon intersection
Distance Problems
- Closest pair of points O(n log n)
- Farthest pair (rotating calipers)
- Point-polygon distance
Triangulation
- Ear clipping O(n^2)
- Delaunay triangulation
- Voronoi diagram
Input Schema
{
"type": "object",
"properties": {
"algorithm": { "type": "string" },
"variant": { "type": "string" },
"language": {
"type": "string",
"enum": ["cpp", "python", "java"]
},
"includeVisualization": { "type": "boolean", "default": false }
},
"required": ["algorithm"]
}Output Schema
{
"type": "object",
"properties": {
"success": { "type": "boolean" },
"code": { "type": "string" },
"complexity": { "type": "object" },
"usage": { "type": "string" }
},
"required": ["success", "code"]
}想直接用这个技能？
本站把开放许可（MIT / Apache 等）的技能按仓库打包整理到网盘，点一下转存到你自己的网盘，不用一个个从 GitHub 拉。许可未声明的技能只给原始仓库链接，不打包。
它属于哪个仓库
星标★ 1,796
本站分层T1
该仓技能数2115
原文件路径
library/specializations/algorithms-optimization/skills/geometry-algorithm-library/SKILL.md