Rank: Guest
Groups: Registered
Joined: 04/07/2015(UTC) Posts: 6,866 Was thanked: 981 time(s) in 809 post(s)
|
As you can see, I have attempted Goursat [Gobstopper]... not to avail. Will try again from the Mathcad program, via Spline Matrix => f(u,v). Jean Rotate Goursat.sm (385kb) downloaded 29 time(s).
|
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 15/07/2010(UTC) Posts: 437 Location: Beer-Sheva Was thanked: 520 time(s) in 288 post(s)
|
Hello, Jean. The algorithm is only suitable for constructing simply-connected Surfaces without singular points. Therefore, for the first surface it not approached, and the second turned out to be of poor quality. The second surface and its upper half, constructed with the help of the new algorithm. GoursatJean.sm (29kb) downloaded 26 time(s).
|
|
|
|
Rank: Guest
Groups: Registered
Joined: 04/07/2015(UTC) Posts: 6,866 Was thanked: 981 time(s) in 809 post(s)
|
Thanks Ber7 for the explanation. Will come back, because very slow on my Win 7 ...
Jean
|
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 30/09/2012(UTC) Posts: 61 Was thanked: 13 time(s) in 8 post(s)
|
Originally Posted by: Ber7 Hello, Jean. The algorithm is only suitable for constructing simply-connected Surfaces without singular points. Therefore, for the first surface it not approached, and the second turned out to be of poor quality. The second surface and its upper half, constructed with the help of the new algorithm. GoursatJean.sm (29kb) downloaded 26 time(s). Such a graph is possible only for a>0 (x1*x2)^2+(x2*x3)^2+(x1*x3)^2 - a=0;
|
|
|
|
Forum Jump
You cannot post new topics in this forum.
You cannot reply to topics in this forum.
You cannot delete your posts in this forum.
You cannot edit your posts in this forum.
You cannot create polls in this forum.
You cannot vote in polls in this forum.