登录
首页 » 数据结构 » 一些常用的几何算法的C++实现,包括两点确定一条直线,两点间距离,点直线距离, 海伦公式求三角形面积,判断直线相交等...

一些常用的几何算法的C++实现,包括两点确定一条直线,两点间距离,点直线距离, 海伦公式求三角形面积,判断直线相交等...

于 2022-06-27 发布 文件大小:3.21 kB
0 168
下载积分: 2 下载次数: 1

代码说明:

一些常用的几何算法的C++实现,包括两点确定一条直线,两点间距离,点直线距离, 海伦公式求三角形面积,判断直线相交等-some common geometric algorithm C achieved, including two identified a straight line, the distance between two points, point straight distance Helen formula for triangle area, as judged straight intersection

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • B-树的创建、插入、删除等一系列操作!-B-tree creation, insert, delete a series of manipulations!
    2022-07-19 17:19:24下载
    积分:1
  • access库转换成excel表格,或由excel表格转入access
    access数据库转换成excel表格,或由excel表格转入access数据库-access database tables into excel, or excel forms to access database
    2022-10-25 21:30:03下载
    积分:1
  • data structure presentation systems and contribute to further understanding and...
    数据结构演示系统,有助于进一步了解和验证数据结构中的算法-data structure presentation systems and contribute to further understanding and validation of data structure algorithms
    2023-08-23 02:45:04下载
    积分:1
  • 完整的库课程设计,含报告,你只需下载就能解决课程设计的问题...
    完整的数据库课程设计,含报告,你只需下载就能解决课程设计的问题-Integrity of the database curriculum design, including the report, you can download curriculum design will be able to solve the problem of
    2022-08-15 15:44:49下载
    积分:1
  • 开发工具 Informix
    开发工具 Informix-4gl- Development kit Informix-4gl
    2022-03-16 21:32:28下载
    积分:1
  • /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means...
    迷宫算法(maze) /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.
    2022-08-08 06:28:42下载
    积分:1
  • 100个vfp 小程序源码,对于初学者来说很有用
    100个vfp 小程序源码,对于初学者来说很有用-100 -100 VFP applet source code, useful for beginners-100
    2023-07-10 07:55:02下载
    积分:1
  • 神经网络中的K均值聚类算法II: 1.KMIn为输入文本,其中,第一个参为所要聚类点个,第二个参为聚类点的维,第三个参为所要求聚类的个...
    神经网络中的K均值聚类算法II: 1.KMIn为输入数据文本,其中,第一个参数为所要聚类点个数,第二个参数为聚类点的维数,第三个参数为所要求聚类的个数 2.KM2OUT为经过K均值聚类算法II计算后得到的结果-Neural network in K-means clustering algorithm II: 1.KMIn input data for the text, of which the first parameter to be the number of clustering points, the second parameter is the dimension of clustering points, the third parameter for the clustering the number of requests for 2.KM2OUT after K-means clustering algorithm II calculation results
    2022-08-10 11:09:03下载
    积分:1
  • Solving clues to binary tree node before the trend and follow
    求解线索二叉树中结点前趋和后继的算法以及以相应次序遍历线索二叉树的算法,二叉树的线索化算法的设计-Solving clues to binary tree node before the trend and follow-up algorithm and the corresponding sequence of binary tree traversal algorithm clues, clues to binary tree algorithm design
    2022-01-25 14:32:44下载
    积分:1
  • 的八皇后问题
    数据结构的八皇后问题-data structure of eight Queens
    2023-01-10 00:05:03下载
    积分:1
  • 696516资源总数
  • 106611会员总数
  • 19今日下载