CGAL users discussion list

["Javi V." <>]

Hello everybody, 

I have spent the last weeks implementing a nD Grid Map container based on
std::vector. Although there are boost multiarrays and new fancy ways of
creating nD vectors with variadic templates, my implementation is based on a
flat vector, in which I work only with indices and the 4connectivity
neighbour search is generalized to n-dimensions, also the conversion from
index to coordinates and viceversa. The best advantage is that the only
thing we need to know in compilation time is the number of dimensions (not
even the size). There were another version in which dimension could also be
decided in runtime, however this was a bit slower since the compiler could
not optimize the loops so much. 

I would like to know if there is something similar in this library and, if
not, is it interesting to be included? How I can contribute in order to
include this container? I think it could be useful for other people. 

Thank you!



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/nD-Grid-Map-tp4658879.html
Sent from the cgal-discuss mailing list archive at Nabble.com.