Location:
Search - shape .n
Search list
Description: 此程序基于二分法的判断点集中的m个点是否在n边形内部.-dichotomy of this procedure based on the judgment of the focus points of m n whether the shape of the internal.
Platform: |
Size: 3861 |
Author: 贾德 |
Hits:
Description: 贝齐尔曲线算法演示程序
实验原理：贝齐尔曲线的形状是通过一组多边折线（也称为贝齐尔控制多边形）的各顶点唯一的定义出来的。
程序思路：先用链表把鼠标点击过的点记录下来，做为控制多边形。然后调用n次Bernstein多项式的基函数运算出曲线的点,最后用直线分段画出来（本程序分成了50段来画）
-Bezier curve algorithm Experimental Demonstration Program Principle : Bezier curve's shape through a multilateral dogleg Group (also known as the Bezier control polygon) of the apex only in the definition years. Procedures ideas : first use the mouse to click the chain put off point on record, as a control polygon. Then called n-Bernstein polynomial function calculate the curve, Finally, subparagraph drawn straight (this program consists of 50 to paint)
Platform: |
Size: 39301 |
Author: Ray |
Hits:
Description: 画图
2.计算计算一组几何图形的面积之和重新写一个函数，类似于sum函数
3.在Shape中添加一个纯虚函数void Draw(CDC *pDC, Coordinate *m_pCoordinate) 它将作为所有几何类绘图的共同方法。
4.添加一个坐标系类：Coordinate。
5.在Polygon中重载void Draw(CDC *pDC)
6.在Ellipse中重载void draw(CDC *pDC)
7.在View类中的OnDraw(CDC *pDC)中将图形画出来
8.调用void draw(CDC *pDC, Shape *a[], int n)实现多个几何图形的绘制
Platform: |
Size: 104229 |
Author: 张平 |
Hits:
Description: 此为编译原理实验报告 学习消除文法左递规算法，了解消除文法左递规在语法分析中的作用 内含 设计算法 目的 源码 等等.... 算法:消除左递归算法为: （1）把文法G的所有非终结符按任一种顺序排列成P1,P2,…Pn 按此顺序执行 （2）FOR i:=1 TO n DO BEGIN FOR j:=1 DO 把形如Pi→Pjγ的规则改写成 Pi→δ1γ δ2γ … δkγ。其中Pj→δ1 δ2 … δk是关于Pj的所有规则； 消除关于Pi规则的直接左递归性 END （3）化简由（2）所得的文法。即去除那些从开始符号出发永远无法到达的非终结符的 产生规则。-to compile this report principle experiment to eliminate learning grammar rules Left delivery algorithm, left the Elimination delivery grammar rules in grammar analysis of the role of the design algorithm containing purpose algorithm source code .... etc. : Elimination left recursive algorithm : (1) grammar, of all non-G website by the end of a paramagnetic Arrange sequence P1, P2, ... Pn implementation of this order (2) FOR i : n = 1 DO TO BEGIN FOR j : = 1 DO put the shape of Pi Gamma approximate rewrite the rules 1 into Pi Gamma Gamma 2 k .... These ions 1 2 ... k ions on all the rules; Pi elimination of the direct rule left recursive END (3) Reduction from (2) from the grammar. Removing that those symbols starting from the beginning will never be able to reach the end of the webs
Platform: |
Size: 44142 |
Author: 何浩 |
Hits:
Description: 0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0 / 1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.
Platform: |
Size: 8915 |
Author: 周易 |
Hits:
Description: 此为编译原理实验报告 学习消除文法左递规算法，了解消除文法左递规在语法分析中的作用 内含 设计算法 目的 源码 等等.... 算法:消除左递归算法为: （1）把文法G的所有非终结符按任一种顺序排列成P1,P2,…Pn 按此顺序执行 （2）FOR i:=1 TO n DO BEGIN FOR j:=1 DO 把形如Pi→Pjγ的规则改写成 Pi→δ1γ δ2γ … δkγ。其中Pj→δ1 δ2 … δk是关于Pj的所有规则； 消除关于Pi规则的直接左递归性 END （3）化简由（2）所得的文法。即去除那些从开始符号出发永远无法到达的非终结符的 产生规则。-to compile this report principle experiment to eliminate learning grammar rules Left delivery algorithm, left the Elimination delivery grammar rules in grammar analysis of the role of the design algorithm containing purpose algorithm source code .... etc. : Elimination left recursive algorithm : (1) grammar, of all non-G website by the end of a paramagnetic Arrange sequence P1, P2, ... Pn implementation of this order (2) FOR i : n = 1 DO TO BEGIN FOR j : = 1 DO put the shape of Pi Gamma approximate rewrite the rules 1 into Pi Gamma Gamma 2 k .... These ions 1 2 ... k ions on all the rules; Pi elimination of the direct rule left recursive END (3) Reduction from (2) from the grammar. Removing that those symbols starting from the beginning will never be able to reach the end of the webs
Platform: |
Size: 44032 |
Author: 何浩 |
Hits:
Description: 0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.
Platform: |
Size: 8192 |
Author: 周易 |
Hits:
Description: 此程序基于二分法的判断点集中的m个点是否在n边形内部.-dichotomy of this procedure based on the judgment of the focus points of m n whether the shape of the internal.
Platform: |
Size: 4096 |
Author: 贾德 |
Hits:
Description: 贝齐尔曲线算法演示程序
实验原理：贝齐尔曲线的形状是通过一组多边折线（也称为贝齐尔控制多边形）的各顶点唯一的定义出来的。
程序思路：先用链表把鼠标点击过的点记录下来，做为控制多边形。然后调用n次Bernstein多项式的基函数运算出曲线的点,最后用直线分段画出来（本程序分成了50段来画）
-Bezier curve algorithm Experimental Demonstration Program Principle : Bezier curve's shape through a multilateral dogleg Group (also known as the Bezier control polygon) of the apex only in the definition years. Procedures ideas : first use the mouse to click the chain put off point on record, as a control polygon. Then called n-Bernstein polynomial function calculate the curve, Finally, subparagraph drawn straight (this program consists of 50 to paint)
Platform: |
Size: 38912 |
Author: Ray |
Hits:
Description: 对于某个m*n的字符串数组，相当于一个m行n列的平面形状的方格。里面S表示起点，W表示障碍，B表示可走（但是不一定可以通），X表示出口。对于起点S，有8个方向可以走，当然前提是在没有障碍的情况之下，其中可以分为单步走（on foot）和跳步走（by jump）两种情况，从起点S开始追寻最短的出口路径count2。-M* n to a string array, which is equivalent to an m line n of the plane out of the box shape. Express the starting point of S inside, W express obstacles, B indicated that they could walk (but not necessarily pass), X express export. For the starting point of S, has 8 direction can go, of course, the premise that there are no obstacles in the circumstances, which can be divided into single-step walk (on foot) and the jump step-by-step walk (by jump) both cases, the starting point S from the beginning to trace the the shortest path export count2.
Platform: |
Size: 953344 |
Author: kineapple |
Hits:
Description: 1、自由曲线包括：二次、三次、N次Bezier曲线，二次、三次均匀B样条曲线；
2、Bezier曲线的实现算法要求选用细分算法；
3、均匀B样条曲线过控制多边形的首末顶点；
4、利用B样条曲线的局部控制性来动态修改曲线形状；
5、界面设计友好、几何直观。
-1, free curve include: the Second, Third, N times Bezier curves, quadratic, cubic uniform B-spline curve 2, Bezier curve algorithm requested subdivision algorithm selection 3, uniform B-spline curve control polygons have been at the end of the first vertex 4, the use of B-spline curve of local control to dynamically modify curve shape 5, interface design friendly, intuitive geometry.
Platform: |
Size: 95232 |
Author: 张巧芳 |
Hits:
Description: 画图
2.计算计算一组几何图形的面积之和重新写一个函数，类似于sum函数
3.在Shape中添加一个纯虚函数void Draw(CDC *pDC, Coordinate *m_pCoordinate) 它将作为所有几何类绘图的共同方法。
4.添加一个坐标系类：Coordinate。
5.在Polygon中重载void Draw(CDC *pDC)
6.在Ellipse中重载void draw(CDC *pDC)
7.在View类中的OnDraw(CDC *pDC)中将图形画出来
8.调用void draw(CDC *pDC, Shape *a[], int n)实现多个几何图形的绘制-Paint 2. Calculation of calculating a set of geometric shapes of the area and re-write a function, similar to sum function 3. In Shape Add a pure virtual function void Draw (CDC* pDC, Coordinate* m_pCoordinate) it will serve as all the geometric types of graphics common methodology. 4. Add a coordinate system type: Coordinate. 5. Polygon in overloaded void Draw (CDC* pDC) 6. In the Ellipse in overloaded void draw (CDC* pDC) 7. In the View class OnDraw (CDC* pDC) will be drawn graphics 8. Call void draw (CDC* pDC, Shape* a [], int n) the mapping of multiple geometric shapes
Platform: |
Size: 104448 |
Author: 张平 |
Hits:
Description: 用matlab绘制bezier曲线，逼近一个n形状。-Matlab draw with Bezier curve, approaching a n shape.
Platform: |
Size: 2048 |
Author: happynoom |
Hits:
Description: 大整数问题
设n是一个k（1≤k≤80）位的十进制正整数。
问题1：对于给定的任意整数n，编程计算满足p3+p2+3p≤n的位数为m的p的个数。
问题2：对于给定的任意整数n，编程求解满足p3+p2+3p≤n的p的最大值。
要求：
对于给定的每一个测试文件（形如：numberX_input.txt），分别生成一个结果文件（形如：numberX_out.txt）。比如，对于测试文件number1_input.txt，对应的结果文件为number1_out.txt。
参考数据：
(1) 若n=1908 ； p的最大值=12
(2) 若n= 2000000000000000000000000000002452458671514234457987956856；
p的最大值= 12599210498948731647-Big problem for integer n is a k (1 ≤ k ≤ 80) decimal places positive integer. Question 1: For a given arbitrary integer n, calculated to meet the p3+ P2+ 3p ≤ n the median number m of p. Question 2: For a given arbitrary integer n, Programming Solution to meet the p3+ P2+ 3p ≤ n the p maximum. Requirements: For a given test every file (such as shape: numberX_input.txt), respectively, the results generate a document (such as shape: numberX_out.txt). For example, the test file number1_input.txt, corresponding to the outcome document for the number1_out.txt. Reference: (1) if n = 1908 p maximum = 12 (2) If n = 2000000000000000000000000000002452458671514234457987956856 p maximum = 12599210498948731647
Platform: |
Size: 1199104 |
Author: ouyang |
Hits:
Description: 本实验要求根据课本中给出的高斯噪声和椒盐噪声的概率分布的形状和参数编写两个通用程序分别给一个图像中添加高斯噪声和椒盐噪声。高斯噪声是n维分布都服从高斯分布的噪声，椒盐噪声是图像中经常见到的一种噪声是一种随机的黑点或者白点。在实验中通过它们对应的概率密度函数得到噪声分布函数进而与原图像进行叠加产生出对应的噪声图像-Textbooks in this experiment are given under the Gaussian noise and salt and pepper noise in the shape of the probability distribution and parameters of common procedures for the preparation of the two images were added to a Gaussian noise and salt and pepper noise. Gaussian noise is subject to the distribution of n-dimensional Gaussian noise, salt and pepper noise is often the image to see a noise is a random white spots or black spots. In the experiment through their corresponding probability density function of the noise distribution function to be the original image superimposed with the corresponding noise generated image
Platform: |
Size: 243712 |
Author: jhm |
Hits:
Description: 看英文题目一开始看不大懂，下面做一下解释：本体就是作者开party然后就做了不同大小不同口味的N个Pie，现在他有k个朋友要参加这个party，但是他的朋友和他要分到相同体积的pie，pie都是圆柱形的，高度全为1.怎么分才能使每个人获得最大体积的pie。同时已知还有各个pie的半径。-My birthday is coming up and traditionally I m serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party and each of them gets a piece of pie. This should be one piece of one pie, not several small pieces since that looks messy. This piece can be one whole pie though.
My friends are very annoying and if one of them gets a bigger piece than the others, they start complaining. Therefore all of them should get equally sized (but not necessarily equally shaped) pieces, even if this leads to some pie getting spoiled (which is better than spoiling the party). Of course, I want a piece of pie for myself too, and that piece should also be of the same size.
What is the largest possible piece size all of us can get? All the pies are cylindrical in shape and they all have the same height 1, but the radii of the pies can be different.
Input
Platform: |
Size: 38912 |
Author: zhangzhanyou |
Hits:
Description: Shape.Net is a .Net forms custom control for the reading and display of ESRI Shapefiles.
Platform: |
Size: 293888 |
Author: GIS Specialist |
Hits:
Description: The indexing of an image database is often referred as feature extraction. Mathematically,
a feature is an n-dimensional vector, with its components computed by some image analysis.
The most commonly used visual cues are color, texture, shape, spatial information, and motion
in video. For example, a feature may represent the color information in an image
Platform: |
Size: 1445888 |
Author: rach |
Hits:
Description: 求解n!的算法。用c++语言描述，挺好的。-Solving n! Algorithms. Using c++ language to describe, in very good shape.
Platform: |
Size: 175104 |
Author: 王继州 |
Hits:
Description: The paper investigates the problem of achieving automatic detection, recognition and
segmentation of object classes in photographs
. N
amely, given an image the
system
is expected to
automatically partiti
on the image
into semantically meaningful areas each labeled with a specific
object class.
Platform: |
Size: 23623680 |
Author: Ritesh Das |
Hits: