Search Comments and Ratings
Comments and Ratings
|
||||
|---|---|---|---|---|
| Date | File | Comment by | Comment | Rating |
| 07 Jul 2009 | Priority Queue (MEX/C++) An efficient priority queue implementation in C++ | Tagliasacchi, Andrea | 1) The C++ library MyHeap.h contains both implementation for MaxHeap and MinHeaps. All you need is to create interface functions along the lines of those I created for the MinHeaps. 2) This would require to add a function in MyHeaps.h but I don't see why not, it should be a very easy operation to do. 3) Position in the tree? Lowest Level? |
|
| 22 May 2009 | Queue (A simple implementation) | Tagliasacchi, Andrea | Good choice for object oriented. However, if you want a generic priority queue which don't assume elements to be Matlab objects refer to my submission. |
|
| 22 May 2009 | Queue (A simple implementation) | Tagliasacchi, Andrea | ||
| 15 May 2009 | Queue (A simple implementation) | Tagliasacchi, Andrea | I wish you implemented a fast queue for matlab, not an object oriented one... |
|
| 30 Mar 2009 | kd-tree for matlab A kd-tree mex implementation which allows for nearest neighbor, k-nearest neighbor, range and ball q | Tagliasacchi, Andrea | kdtree_build() returns a pointer to the kdtree. That number needs to be fed as first argument to every other query method. I haven't tried it on older versions of Matlab but I haven't used any of the new releases functionality. |
|
| 03 Feb 2009 | kd-tree for matlab A kd-tree mex implementation which allows for nearest neighbor, k-nearest neighbor, range and ball q | Tagliasacchi, Andrea | Thanks Kigor, I found a simple bug in the kdtree_nearest_neighbor data conversion. The query was executed MxN times instead of M times; given the query matrix Q is of size(M,N). The updated kdtree_nearest_neighbor.cpp file can be found at
The bug will be corrected in the next release |
|
| 08 Jan 2009 | curvspace Generate evenly spaced points along an existing curve in 2D or 3D. | Tagliasacchi, Andrea | thanks a lot, I didn't want to lose time re-implementing it! |
|
| 03 Dec 2008 | MatlabBGL MatlabBGL provides robust and efficient graph algorithms for Matlab using native data structures. | Tagliasacchi, Andrea | The bioinformatics toolbox provides some functions for graphs as well. However I found a problem in the creation of spanning trees which I already reported. This library on the other hand provide a correct solution. Thanks |
|
|
||||
MATLAB Central Terms of Use
NOTICE: Any content you submit to MATLAB Central, including personal information, is not subject to the protections which may be afforded information collected under other sections of The MathWorks, Inc. Web site. You are entirely responsible for all content that you upload, post, e-mail, transmit or otherwise make available via MATLAB Central. The MathWorks does not control the content posted by visitors to MATLAB Central and, does not guarantee the accuracy, integrity, or quality of such content. Under no circumstances will The MathWorks be liable in any way for any content not authored by The MathWorks, or any loss or damage of any kind incurred as a result of the use of any content posted, e-mailed, transmitted or otherwise made available via MATLAB Central. Read the complete Terms prior to use.
Contact us at files@mathworks.com