The Freeman chain code is a common and useful way for representing discrete paths by means of words such that each letter encodes a step in a given direction. In the discrete plane Z² such a coding is widely used for representing connected discrete sets by their contour which forms a closed and intersection free path. In this paper, we use a multidimensional radix tree like data structure for storing paths in the discreted-dimensional space Z^d. It allows to design a simple and efficient algorithm for detecting path intersection. Even though an extra initialization is required, the time and space complexities remain linear for any fixed dimension d. Several problems that are solved by adapting our algorithm are also discussed.