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: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively. Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull. Time complexity: T(n) = 2T(n/2) + O(n) = O(n log n)
标签： contains Output convex planar
上传时间： 2017-02-19
上传用户：wyc199288
This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.
标签： implementation double-array representing structure
上传时间： 2013-12-10
上传用户：shinesyh
1.an fpga implementation of the image space reconstruction algorithm for hyperspectral imaging analysis 2. fpga implemention of a median filter 3. fpga implementation of digital filters 4.hardware acceleration of edge detection algorithm on fpgas 5.implementation and evaluation of image processing algorithms on reconfigurable architecture using C-based hardware descriptive languages 6. implementing 2D median filter in fpgas 7.视频图像处理与分析的网络资源
标签： implementation reconstruction hyperspectral algorithm
上传时间： 2014-01-10
上传用户：894898248
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
标签： fault-tolerant algorithms redundant underlyin
上传时间： 2013-12-18
上传用户：jkhjkh1982
I was trying to develope a programme to make a slide show of all the pictures of a folder using vb.net. I have spent lot of time in net for searching this but all in vain, I didn t get a simple programme to solve the same and lastly I gave myself a try for the same and developed the code, I have used there a folderbrowserdialogue and a timer with a picture box control and in coding I have used IO name spaces to get the pathe and folder info here is the code. Enjoy Subhankar
标签： programme develope pictures trying
上传时间： 2017-04-24
上传用户：a3318966
对于遥感图像上的地物进行提取，运用Matlab中的Edge函数实现
标签： 遥感图像
上传时间： 2014-01-06
上传用户：362279997
Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound. 2.If a constant subtracted from any row or any column of the cost matrix, an optimal solution does not change.
标签： branch-and-strategy Salesperson Traveling solution
上传时间： 2013-12-29
上传用户：璇珠官人
I upload Suffix Array Pdf file. This is a really good tutorial for guys who are curious about suffix array. It described the meaning of suffix array and also how to built it. Hope this really help guys improving skills about string searching, string matching, etc
标签： tutorial curious upload Suffix
上传时间： 2013-12-11
上传用户：清风冷雨
To write data to the FIFO, present the data to be written and assert the write enable. At the next rising edge of the clock, the data will be written. For every rising edge of the clock that the write enable is asserted, a piece of data is written into the FIFO. If the FIFO has data in it, the value at the head of the FIFO is present on the FIFO data output. To read data from the FIFO, assert the read enable. At the next rising edge of the clock, capture the data output the FIFO will subsequently advance to the next piece of data stored in the FIFO.
上传时间： 2014-08-16
上传用户：wab1981
13、堆 MinHeap.h test.cpp 14、哈夫曼树 BinTreeNode.h BinaryTree.h MinHeap.h Huffman.h Test.cpp 15、树 164 QueueNode.h LinkQueue.h TreeNode.h Tree.h 170 test.cpp 16、B+树 BTreeNode.h BTree.h 192 test.cpp 17、图 217 MinHeap.h Edge.h 222 Vertex.h Graph.h 224 test.cpp 18、排序 Data.h 249 QueueNode.h LinkQueue.h Sort.h 263 test.cpp
标签： MinHeap BinTreeNode BinaryTree Huffman
上传时间： 2017-08-14
上传用户：AbuGe
