Alexey Ivanov

## 1220 Reputation

12 years, 103 days

## Not quite......

@Kitonum
Yuri Nikolaevich,  you should to agree that the question is not quite that.
And you saw an example of my solution on one of the forums so that you can compare with your example.

It's about the simplicity of the general approach, as is the case with inellipse in this topic.

There is a similar program (as at the beginning of the post), but for obtaining the equation of an ellipse circumscribed about a triangle.
Is there a way to parametrically define the circumellipse too, so as not to fiddle with this program further?

## It works in Maple17 too...

@vv
And it works for me too, but when the parameters are  0 < s, t < 1
For example, parameters = [s = 0.01 .. 0.99, t = 0.01 .. 0.99]

## Something has changed, but ......

@mmcdara
Thank you for your assistance. The error message ceased to appear, the first frame and sliders appeared. But when I move the sliders, the triangle and ellipse images disappear and no longer appear. That is, it still does not work.
Nothing, the main thing is not in this, but in the fact that the essence of solving the task by means of parameterization is clear.

## No problem understanding now...

@vv
Thank. Until now, I did not know about the existence of such dependencies.
" Probably in Maple 17 this will work:"
No, for some reason, it doesn't work. But this is no longer relevant, because it is clear what should be.
Thank you again.
(You will laugh when you find out how much effort I put into this program, especially with my Maple "proficiency" level.)

## I have problems understanding...

@vv
I feel that you, as always, are on top. But unfortunately your program doesn't work on my version.
Is it not difficult for you to at least briefly explain your text? Thank you.

## Thank you...

@vv
Yes, there are several ways to solve this problem. The fact is that in some similar examples there is only a finite number of variants of such triangles, and it seemed to me that the easiest way to decide (for fun) is to use the optimization package.
For example, x^4+ y^4 + z^4 - 1 = 0, the maximum area of the triangles is approximately 2.08.

## The answer from myself to myself...

It seems  there is a way to exit the program when a check for the existence condition of the tetrahedron is "NO". We put the program text in a pseudo-loop where the break statement works. If the check passes, then the  print ("GO") is executed; if not, the print ("GO") is not executed. A simple check by point F: if its third coordinate is other than 0, then the program is executed, for example, point (F, 1, 1, 0.000001), if its third coordinate is 0, then the program is not executed.

```restart: with(geom3d):
for j to 1 do
point(A, 0, 0, 0), point(B, 2, 2, 0), point(C, 0, 2, 0), point(F, 1, 1, 0):
gtetrahedron(T1, [A, B, C, F]):
i := nops(op(0, detail(T1))); if i = 1 then print("Ok, gtetrahedron") else    print("No gtetrahedron, NO"); break end if:
print("GO");
end do:
```

## Very nice...

@tomleslie  Thanks a lot. I didn’t want to extend the text of the check, especially since I couldn’t do it as gracefully as you. I have very poor Maple proficiency. I was more interested in understanding how to stop further program execution in the case of `no_tetrahedron_possible`

## "a speed constant"...

@SaeedAF7
I think the author of the topic simply wanted that to him be shown  how to establish uniform rotation of one of the vertical struts of the mechanism (input link of mechanism).

## When head_length = 0 arrow will look li...

You wrote: “I don't understand your code for making a cylinder.
plots [arrow] when head_length = 0 will look like a cylinder. In this case, the cylinder diameter is width=1, and the length of the cylinder is equal to the distance between the middles of the segments with red points. The direction of the arrow is also set along the axis of the cylinder.

## Search...

What about Markiyan Hirnyk  and MaplePrimes Search?

## dsolve/numeric/BVP...

Directly by using Maple functions dsolve/numeric/BVP
managed to find only one solution for many initial data ('approxsoln').
If anyone, of course, is interesting.

```restart;
Digits := 20:
dsys := {diff(x(t), t, t)+.2*(diff(x(t), t))+x(t)^3-.3*cos(t) = 0, x(0) = x(2*Pi), (D(x))(0) = (D(x))(2*Pi)}:
sol := dsolve(dsys, numeric, abserr = 1.*10^(-5), approxsoln = [x(t) = .5, (D(x))(t) = 1.5]):
plots[odeplot](sol, [diff(x(t), t), x(t)], 0 .. 2*Pi)```

## Thank you...

@Janeasefor Thank you very much, very pleased  that you liked it.

## Simple thought...

In principle, I think it is possible to reduce all “inverse kinematics” to one subroutine (for example, in Maple) for any kind of manipulators in order to obtain a solution based on a straight line segment. More precisely, I do not think, in fact, everything is checked in Maple.

 4 5 6 7 8 9 10 Last Page 6 of 25
﻿