搜索结果
找到约 107 项符合
points 的查询结果
按分类筛选
- 全部分类
- matlab例程 (18)
- 其他 (12)
- 数学计算 (8)
- 书籍 (7)
- 数值算法/人工智能 (6)
- 单片机编程 (5)
- 通讯编程文档 (4)
- 技术管理 (4)
- Java编程 (4)
- VC书籍 (4)
- 人工智能/神经网络 (3)
- 文章/文档 (3)
- 编译器/解释器 (2)
- 汇编语言 (2)
- JavaScript (2)
- 其他书籍 (2)
- VIP专区 (2)
- 电源技术 (1)
- GPS编程 (1)
- 电子书籍 (1)
- 嵌入式/单片机编程 (1)
- 行业发展研究 (1)
- 文件格式 (1)
- Java书籍 (1)
- 系统设计方案 (1)
- 软件设计/软件工程 (1)
- 压缩解压 (1)
- 其他嵌入式/单片机内容 (1)
- 软件工程 (1)
- 中间件编程 (1)
- 微处理器开发 (1)
- 通讯/手机编程 (1)
- 多国语言处理 (1)
- Matlab (1)
- 论文 (1)
- 源码 (1)
其他 The Graham scan examines the points one by one and eliminates the points which cause reflexive angle
The Graham scan examines the points one by one and eliminates the points which cause reflexive angles
其他 Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than f
Input : A set S of planar points
Output : A convex hull for S
Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return.
Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR .
Step 3: Recursi ...
JavaScript Create a Delaunay triangulation or Voronoi diagram by clicking points. Delaunay triangulations and V
Create a Delaunay triangulation or Voronoi diagram by clicking points. Delaunay triangulations and Voronoi diagrams are among the most widely used data structures in the field of Computational Geometry. These are Java-oriented source codes.
JavaScript Points in Euclidean space, implemented as double[].Includes simple geometric operations.Uses matrice
Points in Euclidean space, implemented as double[].Includes simple geometric operations.Uses matrices a matrix is represented as an array of Pnts
其他书籍 最新《C和指针》points on c 课后参考答案
最新《C和指针》points on c 课后参考答案,完整版
kenneth a.reek 著
徐波翻译
Java编程 SSD4, exam3 source code, scored 100 points, in the Comrades ssd
SSD4, exam3 source code, scored 100 points, in the Comrades ssd
matlab例程 center of circle usin circum points
center of circle usin circum points
其他 Line & Curve Fitting To 2D Points
Line & Curve Fitting To 2D Points
数学计算 Code for L2-optimal three view triangulation based on calculation of stationary points
Code for L2-optimal three view triangulation
based on calculation of stationary points
数学计算 This is a simple code sample to interpolate a 3d set of points using the bezier algorithm minimized
This is a simple code sample to interpolate a 3d set of points using the bezier algorithm minimized to 4 points.