Computer-implemented method for designing a path of pipes, tubes, air ducts, cables or trays connecting a first point to a second point in a three-dimensional scene, comprising: - providing the first point coupled with a first vector; - providing the second point coupled with a second vector; - computing a set of paths, each path of the set connecting the first point to the second point by following at the most three portions of a parallelepiped, the parallelepiped comprising the provided first point on a first vertex and the provided second point on a second vertex, a portion of the parallelepiped being an edge, a diagonal of a face or a space diagonal, and, for at least one path of the set of paths, at least one portion is a diagonal of a face or a space diagonal, the computing further comprising determining whether the first and second vertices are on opposite faces of the parallelepiped; wherein: • if it is determined that the first and second vertices are on opposite faces of the parallelepiped, the set of paths comprises: - one path comprising one portion made of the space diagonal connecting the first and second points; - six paths comprising two portions having a common vertex of the parallelepiped, one portion being a diagonal of a face of the parallelepiped, the diagonal comprising the first or the second points, and one portion being an edge; - six paths comprising three consecutive portions, each portion being an edge; • if it is determined that the first and second vertices belong to a same face of the parallelepiped, the set of path comprises: - one path comprising one portion being a diagonal of the face the first and second vertices belong to; - two paths comprising two consecutive portions, each portion being an edge; - selecting, upon user action, one path of the set. - providing the first point coupled with a first vector; - providing the second point coupled with a second vector; - computing a set of paths, each path of the set connecting the first point to the second point by following at the most three portions of a parallelepiped, the parallelepiped comprising the provided first point on a first vertex and the provided second point on a second vertex, a portion of the parallelepiped being an edge, a diagonal of a face or a space diagonal, and, for at least one path of the set of paths, at least one portion is a diagonal of a face or a space diagonal, the computing further comprising determining whether the first and second vertices are on opposite faces of the parallelepiped; wherein: • if it is determined that the first and second vertices are on opposite faces of the parallelepiped, the set of paths comprises: - one path comprising one portion made of the space diagonal connecting the first and second points; - six paths comprising two portions having a common vertex of the parallelepiped, one portion being a diagonal of a face of the parallelepiped, the diagonal comprising the first or the second points, and one portion being an edge; - six paths comprising three consecutive portions, each portion being an edge; • if it is determined that the first and second vertices belong to a same face of the parallelepiped, the set of path comprises: - one path comprising one portion being a diagonal of the face the first and second vertices belong to; - two paths comprising two consecutive portions, each portion being an edge; • if it is determined that the first and second vertices are on opposite faces of the parallelepiped, the set of paths comprises: - one path comprising one portion made of the space diagonal connecting the first and second points; - six paths comprising two portions having a common vertex of the parallelepiped, one portion being a diagonal of a face of the parallelepiped, the diagonal comprising the first or the second points, and one portion being an edge; - six paths comprising three consecutive portions, each portion being an edge; - one path comprising one portion made of the space diagonal connecting the first and second points; - six paths comprising two portions having a common vertex of the parallelepiped, one portion being a diagonal of a face of the parallelepiped, the diagonal comprising the first or the second points, and one portion being an edge; - six paths comprising three consecutive portions, each portion being an edge; • if it is determined that the first and second vertices belong to a same face of the parallelepiped, the set of path comprises: - one path comprising one portion being a diagonal of the face the first and second vertices belong to; - two paths comprising two consecutive portions, each portion being an edge; - one path comprising one portion being a diagonal of the face the first and second vertices belong to; - two paths comprising two consecutive portions, each portion being an edge; - selecting, upon user action, one path of the set.