If the requirement is only searching in 3-D .. there is a famous data structure K-D tree.
On Tue, Oct 23, 2012 at 5:54 PM, bharat b <[email protected]>wrote: > we can represent in 3-D array .. > what type of elements are those .. is there any special kind of formation > among elements for searching? we have to think about searching based on the > criteria .. > > > On Tue, Oct 23, 2012 at 3:34 PM, saket <[email protected]> wrote: > >> We have a long chain of cuboids in all the six directions (six faces). >> One start node is given and one end node is given. Give a data structure to >> represent this also search for the given node from start node. >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To view this discussion on the web visit >> https://groups.google.com/d/msg/algogeeks/-/5GuOVuTne4cJ. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
