Description: 基于对话框的直线交点计算程序，且可以得出众多交点的最小区域，对学习vc＋＋应用，以及直线相交算法等颇有益处！-Dialog based on a straight line intersection calculation program, and can reach a large number of intersection points of the smallest region, on learning vc application, as well as the straight-line intersection algorithm is quite useful! Platform: |
Size: 50176 |
Author:hello |
Hits:
Description: 该程序实现了摄影测量学中的空间前方交会，即利用像片点坐标求出对应点坐标。用户只要将原始文件夹里的内容更改就可以利用该程序求出想要的数据了。-Procedures for the implementation of the photogrammetry study space forward intersection, which coordinates the use of image point coordinates of corresponding points are obtained. As long as the original user folder changed the contents of the program can be obtained using the data you want. Platform: |
Size: 2048 |
Author:guo |
Hits:
Description: 基于光线投射变换的三维模型特征提取,以三维模型的重心为球心的最小包围球剖分成一系列同心球壳，落入每个球壳的射线与模型表面的交点定义一个球坐标方程。一般地，对于每条射线，它与模型表面的多个交点同时落入一个球壳的几率大大降低了，这样就可以尽可能的减少信息的丢失。-Transform-based ray-casting feature extraction of three-dimensional model to three-dimensional model for the core focus of the post-mortem into the smallest ball surrounded by a series of concentric spherical shell, falling into the hands of each spherical shell model of the surface-ray intersection with the definition of a spherical coordinate equation. In general, for each ray, the surface of it with the model number of intersection points falling into the hands of a spherical shell at the same time greatly reduces the probability that such a reduction could be as much as possible the loss of information. Platform: |
Size: 1310720 |
Author:周光有 |
Hits:
Description: 分东西和南北两个路口模拟交通三色信号灯的亮灭控制-East and West and North-South two intersection points simulated three-color traffic signal control of bright eliminate Platform: |
Size: 1024 |
Author:pysnr |
Hits:
Description: 程序可以求出两条直线的所有交点，进行放大或缩小显示以及标记出交点。-Find all the intersection points of two lines and zoom the lines. Platform: |
Size: 17483776 |
Author:张庆岭 |
Hits:
Description: 运用仿生模式识别方法构建提取基本笔段的神经元序列覆盖手写体汉字图像, 分析笔段神经元间的拓扑性质, 将手写体汉字图像转化为具有容错表征方式的种汉字笔划类型组成的几何图形模仿人类汉字形码输人法统计具有冗余容错形状的笔划神经元类型、数量、位置、相合和相交点数量, 建立手写体汉字特征知识的数据结构表对一手写体汉字库中手写体汉字识别进行仿真实验。方法具有较强的“ 认知”手写体汉字的能力-Construction of the use of pattern recognition methods of extracting essential Strokes neurons handwritten Chinese character image sequence coverage, analysis Strokes topological properties of neurons, the handwritten Chinese character image into a fault-tolerant species Representation type of character strokes mimic the human form of geometry Statistics character image code input method has the shape of the strokes Redundancy neuron type, quantity, location, consistency, and the intersection points, and build knowledge of handwritten Chinese character feature table data structure of a handwritten Chinese character recognition of handwritten Chinese characters library of simulation experiments. The results proved that this method has a strong "cognitive" ability of handwritten Chinese characters. Platform: |
Size: 1232896 |
Author:郭事业 |
Hits:
Description: 给定一个N*N 的方形网格，设其左上角为起点◎，坐标为（1，1），X轴向右为正，Y轴向下为正，每个方格边长为1。一辆汽车从起点◎出发驶向右下角终点▲，其坐标为（N，N）。在若干个网格交叉点处，设置了油库，可供汽车在行驶途中加油。汽车在行驶过程中应遵守如下规则：
（1）汽车只能沿网格边行驶，装满油后能行驶K 条网格边。出发时汽车已装满油，在起点与终点处不设油库。
（2）当汽车行驶经过一条网格边时，若其X 坐标或Y 坐标减小，则应付费用B，否则免付费用。
（3）汽车在行驶过程中遇油库则应加满油并付加油费用A。
（4）在需要时可在网格点处增设油库，并付增设油库费用C（不含加油费用A）。
（5）(1)～(4)中的各数N、K、A、B、C均为正整数。
编程任务：
求汽车从起点出发到达终点的一条所付费用最少的行驶路线。
数据输入：
第一行是N，K，A，B，C的值，2 <=N<=100，2<=K<=10。
第二行起是一个N*N 的0-1方阵，每行N 个值，至N+1行结束。方阵的第i
行第j 列处的值为1 表示在网格交叉点（i，j）处设置了一个油库，为0 时表示未设油库。各行相邻的2 个数以空格分隔。
结果输出:
第1 行中的数是最小费用值。-Given an N* N square grid, set the upper left corner as a starting point ◎, coordinates (1,1), X-axis to the right is positive, Y axis is under, each square of side length 1. A car starting from the starting point towards lower right corner of the end ◎ ▲, the coordinates (N, N). In the number of grid intersection points, set up oil depot, car driving on the way for refueling. Car in motion the process should comply with the following rules:
(1) car can only travel along the grid edge, full of oil can travel the grid section K edge. When the car was filled with oil starting in the beginning and the end of office does not set oil tanks.
(2) when the vehicle traveling through a grid edge, if the X coordinate or Y coordinate decreases, then meet the cost of B, or to avoid payment.
(3) car encountered in the process of moving fuel tank should fill up and pay costs of A.
(4) require the grid point when additional fuel tank, and pay the additional cost of tank C (excluding fuel costs Platform: |
Size: 875520 |
Author:wakaka |
Hits:
Description: 给定一个N*N 的方形网格，设其左上角为起点◎，坐标为（1，1），X 轴向右为正，Y 轴向下为正，每个方格边长为1。一辆汽车从起点◎出发驶向右下角终点▲，其坐标为（N， N）。在若干个网格交叉点处，设置了油库，可供汽车在行驶途中加油。汽车在行驶过程中应遵守如下规则：
求汽车从起点出发到达终点的一条所付费用最少的行驶路线。-Given an N* N square grid, set the upper left corner as a starting point ◎, coordinates (1,1), X-axis to the right is positive, Y axis under positive side of each box is 1. A car starting from the starting point towards the bottom right corner of the end ◎ ▲, the coordinates (N, N). In a number of grid intersection points, set the oil tanks, fuel for the car is moving his way. The car is moving process should observe the following rules: find cars starting from the starting point to reach the end of a driving route with the least paid. Platform: |
Size: 2048 |
Author:白云 |
Hits:
Description: 给定一个N*N 的方形网格，设其左上角为起点◎，坐标为（1，1），X 轴向右为正，Y 轴向下为正，每个方格边长为1。一辆汽车从起点◎出发驶向右下角终点▲，其坐标为（N， N）。在若干个网格交叉点处，设置了油库，可供汽车在行驶途中加油。汽车在行驶过程中应遵守如下规则：
求汽车从起点出发到达终点的一条所付费用最少的行驶路线。-Given an N* N square grid, set the upper left corner as a starting point ◎, coordinates (1,1), X-axis to the right is positive, Y axis under positive side of each box is 1. A car starting from the starting point towards the bottom right corner of the end ◎ ▲, the coordinates (N, N). In a number of grid intersection points, set the oil tanks, fuel for the car is moving his way. The car is moving process should observe the following rules: find cars starting from the starting point to reach the end of a driving route with the least paid. Platform: |
Size: 2048 |
Author:白云 |
Hits:
Description: X1,X2,X3,X4分别为4个点的三维坐标，例如X1=[1,2,3]，本程序可以计算出直线X1X2与X3X4的交点P的坐标X，如果直线X1X2与X3X4不相交，则给出的是直线X1X2与X3X4的公垂线在直线X1X2上的垂足的坐标。-X1, X2, X3, X4 are 4 three-dimensional coordinates of points, such as X1 = [1,2,3], the program can calculate the intersection of line P X1X2 and X3X4 coordinates X, X1X2 and X3X4 if the line does not intersect , is given a straight vertical public X1X2 and X3X4 X1X2 on the pedal in a straight line coordinates. Platform: |
Size: 51200 |
Author:wyc |
Hits:
Description: 汽车加油行驶问题（习题3-16）
问题描述：
给定一个N*N 的方形网格，设其左上角为起点，坐标为（1，1），X 轴向右为正，Y 轴向下为正，每个方格边长为1。一辆汽车从起点出发驶向右下角终点，其坐标为（N，N）。
在若干个网格交叉点处，设置了油库，可供汽车在行驶途中加油。汽车在行驶过程中应遵守如下规则：
（1）汽车只能沿网格边行驶，装满油后能行驶K 条网格边。出发时汽车已装满油，在起点与终点处不设油库。
（2）当汽车行驶经过一条网格边时，若其X 坐标或Y 坐标减小，则应付费用B，否则免付费用。
（3）汽车在行驶过程中遇油库则应加满油并付加油费用A。
（4）在需要时可在网格点处增设油库，并付增设油库费用C（不含加油费用A）。
（5）(1)～(4)中的各数N、K、A、B、C均为正整数。
算法设计：
求汽车从起点出发到达终点的一条所付费用最少的行驶路线。
-Driving automobile fuel problem (Exercise 3-16)
Problem description:
Given an N* N square grid, set the upper left corner as a starting point, coordinates (1,1), X-axis to the right is positive, Y axis under
Positive side of each square is 1. A car starting from the starting point towards the lower right corner of the end, the coordinates (N, N).
In a number of grid intersection points, set the oil tanks, fuel for the car is moving his way. Car in motion the process to be observed, such as
The following rules:
(1) The car can only travel along the grid edge, full of oil can travel the grid section K edge. Starting when the car was filled with oil, in the beginning and the end
No point depot.
(2) When the vehicle driving through a mesh edge, if the X coordinate or Y coordinate decreases, the fees payable B, or toll-free
Use.
(3) vehicles in the process of moving the event should fill up and pay for fuel oil storage costs A.
(4) when required grid points in the addi Platform: |
Size: 38912 |
Author: |
Hits:
Description: 摄影测量中在获得内外方位元素之后，借用此程序可以实现计算地面点坐标，以及评判内外方位元素好坏-Photogrammetry in access to internal and external orientation elements, the loan program can calculate the coordinates of ground points, and the quality evaluation and external orientation elements Platform: |
Size: 93184 |
Author:jiangming |
Hits:
Description: 给定一个N*N 的方形网格，设其左上角为起点◎，坐标为（1，1），X轴向右为正，Y轴向下为正，每个方格边长为1。一辆汽车从起点◎出发驶向右下角终点▲，其坐标为（N，N）。在若干个网格交叉点处，设置了油库，可供汽车在行驶途中加油。汽车在行驶过程中应遵守如下规则：
（1）汽车只能沿网格边行驶，装满油后能行驶K 条网格边。出发时汽车已装满油，在起点与终点处不设油库。
（2）当汽车行驶经过一条网格边时，若其X 坐标或Y 坐标减小，则应付费用B，否则免付费用。
（3）汽车在行驶过程中遇油库则应加满油并付加油费用A。
（4）在需要时可在网格点处增设油库，并付增设油库费用C（不含加油费用A）。
（5）(1)～(4)中的各数N、K、A、B、C均为正整数。
编程任务：
求汽车从起点出发到达终点的一条所付费用最少的行驶路线。
数据输入：
第一行是N，K，A，B，C的值，2 <=N<=100，2<=K<=10。
第二行起是一个N*N 的0-1方阵，每行N 个值，至N+1行结束。方阵的第i
行第j 列处的值为1 表示在网格交叉点（i，j）处设置了一个油库，为0 时表示未设油库。各行相邻的2 个数以空格分隔。
结果输出:
第1 行中的数是最小费用值。
-Given an N* N square grid, set the upper left corner as a starting point ◎, coordinates (1,1), X-axis to the right is positive, Y axis, is positive, each square side length of 1. Starting a car approached from the lower right corner of the end point ◎ ▲, its coordinates (N, N). In a number of grid intersection points, set the oil tanks, fuel for vehicles in a moving way. Vehicle in motion the process should follow the following rules:
(1) car can only travel along the grid edges, filled with oil can travel after the K edge of the grid. Starting when the car has been filled with oil, not in the starting and ending at the depot is located.
(2) when the vehicle is traveling through a mesh edge, if the X coordinate or Y coordinate decreases, then the fees payable B, or toll-free use.
(3) the process of moving car in case of fuel oil tanks should fill up and pay the cost of A.
(4) when needed at additional grid point depot, depot and pay the additional cost of C (excluding fuel costs A) Platform: |
Size: 1024 |
Author:张开 |
Hits:
Description: There are 200 random lines. This program is used to calculate how many intersection points they have. Platform: |
Size: 1024 |
Author:ting |
Hits:
Description: CIRCLEINTERSECT Finds intersection of two circles.Function to return the intersection points between two circles given their centres and radi.-CIRCLEINTERSECT Finds intersection of two circles.Function to return the intersection points between two circles given their centres and radi. Platform: |
Size: 1024 |
Author:LOKESH |
Hits:
Description: 本人刚刚做的数学建模比赛题目和求解程序，是图像中的“交叉点”检测问题。先是对图像去噪去模糊光照均匀后再二值化，然后利用角点检测方法得到图像中的角点，最后聚类分析，剔除不合格角点，最终得到交叉点的坐标。-I just do mathematical modeling and solving program title game, is the image of the "crossover point" detection. First, go to blur the image de-noising uniform illumination after binarization, and then use the corner detection method to obtain an image of the corner, the last cluster analysis, eliminate unqualified corner, finally get the coordinates of intersection points. Platform: |
Size: 3549184 |
Author:niexiaoer |
Hits:
Search - intersection points