How can i generate Computational Geometry with Delaunay in 3D ?

I need to create a Delaunay 3D in space but with orthogonal nodes between to nodes

P1=5360,8850,23962 & P2=9630,4010,11216 then need to get I,J&K.

[John D'Errico]

I don't think you understand the purpose of a tool like delaunay. Delaunay creates triangles in 2-d, or in higher than 2 dimensions it creates tetrahedra, or beyond that, it creates n-simplexes that tessellate a domain.

You cannot create a dissection with orthogonal nodes using a tool like delaunay. I'm not even positive what "orthogonal nodes" may mean to you, although I might guess.

Next, tools like delaunay do not create new nodes internally to the convex hull of the point set you provide. So whatever you want, delaunay does not directly serve that purpose.

Regardless, you have indicated only TWO points, in THREE dimensions. So no tessellation of any kind is possible. Use of delaunay would serve no purpose at all.

Are you asking to generate new points along the straight line between the two points you have indicated?

[Mahmoud Sami]

Thanks a lot for your answer. I know that Delaunay creates a triangle or tetrahedra. The problem that I need to create nodes between two points in space, but in orthogonal lines and then can get the unit vectors I, J & K.

[John D'Errico]

What does that have to do with a Delaunay tessellation? (Answer: Absolutely nothing at all.)

As far as this is concerned "...to create nodes between two points in space, but in orthogonal lines and then can get the unit vectors I, J & K."

Sorry, but that makes no sense at all. You are just throwing around some words there.

Given two points, you can create new points along the line between them. That is pretty trivial. But I have no idea if that is what you need, in fact, I doubt it is. But what does "orthogonal lines" mean? And what unit vectors are you talking about?

If you want help, you need to CLEARLY explain what you are looking to do. Give an example if necessary. Draw a picture. You can do that in two dimensions if you wish.

[Mahmoud Sami]

I need to get the shortest path between that two nodes. I found a code using Dijkstra to get the shortest path, but he creates the geometry with Delaunay. The difference is that the moves must be orthogonal.