Jun
6
awarded Informed
May
23
answered Point cloud registration using pcl
Jan
30
answered How to detect the difference between two 3D point clouds?
Dec
10
comment Descriptors for Pointclouds
Yep, nice work. No, I'm not the author of the article.
Nov
28
answered Descriptors for Pointclouds
Nov
6
answered Simplifying a set of points
Jun
25
awarded Teacher
Jun
25
answered Algorithm for superimposition of 3d points
May
17
awarded Supporter
May
4
revised Need a good overview for Succinct Data Structures
added link to an an answer to this question I've receved in cstheory section
May
4
awarded Scholar
May
4
accepted Need a good overview for Succinct Data Structure algorithms
May
2
comment Need a good overview for Succinct Data Structure algorithms
Thank you for very good answer!
May
2
awarded Supporter
May
2
awarded Student
May
2
asked Need a good overview for Succinct Data Structure algorithms
May
1
comment Need a good overview for Succinct Data Structures
First of all, because it's marvelously compact. 2bits per binary tree node is by far more superior then any other representation I knew or could think of. Additional O(N*loglog(N)/log(N)) bits of auxiliary space to deal with that representation is easily affordable. Because of compactness it looks very promising that for processing trees stored in external memory all performance drawbacks in using succinct representation are comparable with performance gain due to significantly more compact representation (unless there are serious locality problems like in my case with breath-first layout).
Apr
30
awarded Editor
Apr
30
revised Need a good overview for Succinct Data Structures
added 374 characters in body
Apr
30
awarded Student
1 2