## The Vertex and Foci of a Parametrizied Conic ...

Hi Mapleprimes,

I have a conic section that is parametric.  Namely,

x(t) = 9t^2 + 3t  + 367
y(t) = 3t^2 + 2t + 122

How can I find the Vertex and Foci of this curve?
Also, How can I do this for the general case?

Regards,

Matt

## Clever cutter 4...

Let a planar polygon P without selfintersections be given through the plottools:-polygon command.
How to find its triangulation as a set of triangles (The indication of common sides is desired too.) in an optimal way with Maple? This is used in the finite element method.

## Clever cutter 3...

Let a convex polygon, for example Q:=polygon([[0,2],[1,4],[4,4],[5,1],[3,0]]), be given.
How to find the disk of the biggest radius which is contained in Q?
How to find the disk of the smallest radius which contains Q? Of course, with Maple.

## Clever cutter 2...

Let a convex polygon, for example Q:=polygon([[0,2],[1,4],[4,4],[5,1],[3,0]]), be given.
How to find the rectangle of the biggest area which is contained in Q?
A procedure is required. This problem seems to be more complex than the previous one.

## Clever cutter ...

Let the polygon P:=polygon([[0,2],[1,4],[2,3.5],[4,4],[5,1],[4,0.75],[3,0]])

be given.
How to find the rectangle of the minimal area which contains P? Of course, with Maple. Is it a rectangle having a side parallel to the longest diagonal of P?
The same problem in the general case: a procedure is required.

## Geometry: Why does it not find an intersection poi...

THis is part of the code I used in the geometry package:

with(geometry):

circle(c,50811.89143+x^2+y^2-61.91881776*x-446.5619114*y = 0);

line(l,1621.451347-0.1838809e-1*x-7.2593834*y = 0):

draw([c,l]);
intersection(X,c,l,[F1,F2]);

## Geometric transformations...

Hello

I've to do some geometric work ; the problem is that it seems to me there will be no other solution than trying a different approach of the problem, due to huge amount of time required by computation...

However, I would have liked to learn how my program can be fastened. I've heard of multi threaded programming model ; could it be applied here ?

To simplify, I have a initial point (its coordinates). My procedure...

## How to prove Morley's trisector theorem with Maple...

Look here concerning this theorem, which states that in any triangle, the three points of intersection of the adjacent angle trisectors form an equilateral triangle, called the Morley triangle.