Location:
Search - a stra
Search list
Description: 用贪心算（DIJK-STRA）法求最短路径 。
算法基础实验课上可以用到。-Use greedy operator (DIJK-STRA) method for the shortest path. Algorithm based on experimental classes may be used.
Platform: |
Size: 1024 |
Author: 乐正清 |
Hits:
Description: ACM94国际大学生编程竞赛东中心区试题-Description
n the game of Jack Straws, a number of plastic or wooden "straws" are dumped on the table and players try to remove them one-by-one without disturbing the other straws. Here, we are only concerned with if various pairs of straws are connected by a path of touching straws. You will be given a list of the endpoints for some straws (as if they were dumped on a large piece of graph paper) and then will be asked if various pairs of straws are connected. Note that touching is connecting, but also two straws can be connected indirectly via other connected straws.
Input
A problem consists of multiple lines of input. The first line will be an integer n (1 < n < 13) giving the number of straws on the table. Each of the next n lines contain 4 positive integers, x1 , y1 , x2 and y2 , giving the coordinates, (x1 y1 ) (x2 y2 ) of the endpoints of a single straw. All coordinates will be less than 100. (Note that the straws will be of varying lengths.) The first stra
Platform: |
Size: 1024 |
Author: 王强 |
Hits:
Description: 为了能有效解决H ough 变换的计算量大的问题，文中提出了一种基于直线局部结构特征的H ough 变换改进的直
线检测算法。该算法根据F reem an 准则分析了直线上基元的特征信息，通过图像上邻近的同类基元的倾斜角约束基元上
像素点的极角范围，减少每个点的计算次数，在保持精度的同时，提高直线检测的速度，在有噪声的情况下，该算法相对标
准H ough 变换算法可以提高到6 到7 倍。
-In o rder to effectively solve the pro blem of decreasing com putation in the process of using H ough T ransform (w r ) to extract
str aigh t line ．an im p ro v ed H T algo ri th m m etho d is p res en ted b ased O n-th e loc al ch aracteri stics o f the straig h t lin e ．A cc ord ing to F ree m a n
C ri te ria ，th e im p rov ed m eth o d an a lyzes e lem en tary line seg m e n ts s tru ctu re o f th e stra ig h t lin e ，an d d efine s th e sco p e of t3o lar an g le o f th e
points on elem entary line segm ents by com putin g the tilt ang le of the straight line d eterm ined by the tw o adjacent an d cong eneri c elem en —
tary sin e seg m en ts ，an d th en d ec rea se s th e c om p uting tim es o f ev ery po in t ．P o in ting to th e im a g e co n tain ing n o ise ，th e tes ting da ta sh o w s
th a t v elo c ity o f th e im p ro v ed a lg o rithm is 6- 7 tim es as fas t aS th e stan d ~ d o n e ，w h ile th e prec ision is k e p t．
Platform: |
Size: 16848896 |
Author: zheng mingzhi |
Hits:
Description: Bluetooth蓝牙测试的样例代码
ACM94国际大学生编程竞赛东中心区试题((Description n the game of Jack Straws, a number of plastic or wooden "straws" are dumped on the table and players try to remove them one-by-one without disturbing the other straws. Here, we are only concerned with if various pairs of straws are connected by a path of touching straws. You will be given a list of the endpoints for some straws (as if they were dumped on a large piece of graph paper) and then will be asked if various pairs of straws are connected. Note that touching is connecting, but also two straws can be connected indirectly via other connected straws. Input A problem consists of multiple lines of input. The first line will be an integer n (1 < n < 13) giving the number of straws on the table. Each of the next n lines contain 4 positive integers, x1 , y1 , x2 and y2 , giving the coordinates, (x1 y1 ) (x2 y2 ) of the endpoints of a single straw. All coordinates will be less than 100. (Note that the straws will be of varying lengths.) The first stra))
Platform: |
Size: 340992 |
Author: QAQ+
|
Hits: