Rank: 369 based on 187 downloads (last 30 days) and 7 files submitted
photo

Andrea Tagliasacchi

E-mail
Company/University
École Polytechnique Fédérale de Lausanne

Personal Profile:

I currently am a researcher at the EPFL graphics lab http://lgg.epfl.ch of Dr. Mark Pauly. I was a researcher at the GrUVi Labs of Simon Fraser University under the supervision of Dr. Richard Zhang and Daniel Cohen-Or.

Professional Interests:
Digital Geometry Processing

 

Watch this Author's files

 

Files Posted by Andrea View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
14 May 2013 Screenshot patch_rasterize Rasterization of a 2D triangulation Author: Andrea Tagliasacchi patch, triangulation, rasterization 12 0
11 May 2011 Create/access figures by name Create figures by specifying a string identifier rather than a number Author: Andrea Tagliasacchi figure 1 0
20 Feb 2011 Screenshot Priority Queue (MEX/C++) An efficient priority queue implementation in C++ Author: Andrea Tagliasacchi data structure, priority, priority queue, heap, max heap 18 8
  • 5.0
5.0 | 4 ratings
01 Sep 2010 Screenshot kd-tree for matlab A kd-tree mex lib which allows for nearest neighbor, k-nearest neighbor, range and ball queries Author: Andrea Tagliasacchi kd tree, kdtree_buildcpp, utilities, mathematics, miscellaneous, data structure 140 27
  • 4.81818
4.8 | 11 ratings
11 Sep 2008 Screenshot gif_add_frame creates a gif animation of snapshots Author: Andrea Tagliasacchi animation, graphics import, gif, movie, graphics export, utilities 9 1
  • 5.0
5.0 | 1 rating
Comments and Ratings by Andrea View all
Updated File Comments Rating
22 Oct 2012 Priority Queue (MEX/C++) An efficient priority queue implementation in C++ Author: Andrea Tagliasacchi

The SVN now contains the corrections pointed out by Levi and Jeremy.

15 Jun 2012 kd-tree for matlab A kd-tree mex lib which allows for nearest neighbor, k-nearest neighbor, range and ball queries Author: Andrea Tagliasacchi

Sorry for the butchered english in my last message ^_^

14 Jun 2012 kd-tree for matlab A kd-tree mex lib which allows for nearest neighbor, k-nearest neighbor, range and ball queries Author: Andrea Tagliasacchi

Be advised.. The library has been subject to large updates and it's in Beta. It's much faster and it offers a matlab class wrapper. The updated library can be found at the following URL:
(Includes 64bit binaries for OSX and WIN7)

http://code.google.com/p/kdtree-matlab/

04 Jun 2012 kd-tree for matlab A kd-tree mex lib which allows for nearest neighbor, k-nearest neighbor, range and ball queries Author: Andrea Tagliasacchi

@Jose, yah the tree is static.. sorry
@Bryan, that's a good question :) I am working on the library these days, I will try to answer it.

20 Feb 2011 Priority Queue (MEX/C++) An efficient priority queue implementation in C++ Author: Andrea Tagliasacchi

Tim I updated the backIdx error you pointed out. Up to date source (and OSX binaries) can be found at:

http://latis.cs.sfu.ca/svn/users/ata2/matlibs/myheaps/

Use an SVN client to check out the source

Comments and Ratings on Andrea's Files View all
Updated File Comment by Comments Rating
15 Jun 2013 kd-tree for matlab A kd-tree mex lib which allows for nearest neighbor, k-nearest neighbor, range and ball queries Author: Andrea Tagliasacchi Chen, Lingji

Great work! Thank you!

A question: I inferred this from your demo, but wanted to confirm with you: The index returned by a query is guaranteed to correspond to the row index of the data used to create the kd-tree, correct?

22 Mar 2013 kd-tree for matlab A kd-tree mex lib which allows for nearest neighbor, k-nearest neighbor, range and ball queries Author: Andrea Tagliasacchi Du Toit, Philip

Thank you! Gave my application 100x speedup.

07 Nov 2012 Priority Queue (MEX/C++) An efficient priority queue implementation in C++ Author: Andrea Tagliasacchi Haw-Shiuan

In svn version, I found that after line "heap[0] = heap.back();" (line 141 in "MyHeap.h"), we should add " backIdx[ heap[0].second ] = 0;" to preserve the correctness of back index.

22 Oct 2012 Priority Queue (MEX/C++) An efficient priority queue implementation in C++ Author: Andrea Tagliasacchi Tagliasacchi, Andrea

The SVN now contains the corrections pointed out by Levi and Jeremy.

20 Oct 2012 Priority Queue (MEX/C++) An efficient priority queue implementation in C++ Author: Andrea Tagliasacchi Kawahara, Jeremy

Hi, great code! Thanks for sharing! :)

Two small bugs...

1) The current MinHeap will keep adding elements instead of updating them.

The fix is to remove the extra "useBackIdx" condition in "MyHeap.H" in the MinHeap->void push() function.

So change line 316
======
if( useBackIdx || backIdx[index] == -1 ){

to
if( backIdx[index] == -1 ){
======

2) To get this code to work on a 64-bit machine I had to change the addresses from "long" to "unsigned long long". I did this change pretty much anytime something I saw something was cast to a "long".

Hope that helps!
Thanks! -- Jeremy

Top Tags Applied by Andrea
data structure, utilities, 3d, animation, arcball
Files Tagged by Andrea View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
14 May 2013 Screenshot patch_rasterize Rasterization of a 2D triangulation Author: Andrea Tagliasacchi patch, triangulation, rasterization 12 0
11 May 2011 Create/access figures by name Create figures by specifying a string identifier rather than a number Author: Andrea Tagliasacchi figure 1 0
20 Feb 2011 Screenshot Priority Queue (MEX/C++) An efficient priority queue implementation in C++ Author: Andrea Tagliasacchi data structure, priority, priority queue, heap, max heap 18 8
  • 5.0
5.0 | 4 ratings
01 Sep 2010 Screenshot kd-tree for matlab A kd-tree mex lib which allows for nearest neighbor, k-nearest neighbor, range and ball queries Author: Andrea Tagliasacchi kd tree, kdtree_buildcpp, utilities, mathematics, miscellaneous, data structure 140 27
  • 4.81818
4.8 | 11 ratings
11 Sep 2008 Screenshot gif_add_frame creates a gif animation of snapshots Author: Andrea Tagliasacchi animation, graphics import, gif, movie, graphics export, utilities 9 1
  • 5.0
5.0 | 1 rating

Contact us