# Difference between revisions of "Math bits"

(Added method to draw tan1_2p) |
(added contour area, line) |
||

Line 1: | Line 1: | ||

+ | == Area within a simple closed contour == | ||

+ | Given a simple (''i.e.'' not self-intersecting) closed contour with line/arc/elliptic arc entities, the enclosed area is found by [http://en.wikipedia.org/wiki/Green's_theorem Green's Theorem] | ||

+ | |||

+ | <math> | ||

+ | S=\oint x dy | ||

+ | </math> | ||

+ | |||

+ | This type of line integrals has closed forms for lines, arcs, and ellipses. | ||

+ | ===Line=== | ||

+ | <math> | ||

+ | \int_0^1 [x_0+(x_1-x_0)t](y_1-y_0)dt=\frac{1}{2}(x_1+x_0)t](y_1-y_0) | ||

+ | </math> | ||

+ | |||

+ | where <math>(x_0, y_0)</math> and <math>(x_1, y_1)</math> are the start and end point of the line, perspectively. | ||

+ | |||

+ | |||

== The nearest point on an ellipse to a given point == | == The nearest point on an ellipse to a given point == | ||

An ellipse in the coordinates orientated alone its major and minor axes is given as, | An ellipse in the coordinates orientated alone its major and minor axes is given as, |

## Revision as of 06:14, 2 August 2014

## Contents

## Area within a simple closed contour

Given a simple (*i.e.* not self-intersecting) closed contour with line/arc/elliptic arc entities, the enclosed area is found by Green's Theorem

This type of line integrals has closed forms for lines, arcs, and ellipses.

### Line

where (*x*_{0},*y*_{0}) and (*x*_{1},*y*_{1}) are the start and end point of the line, perspectively.

## The nearest point on an ellipse to a given point

An ellipse in the coordinates orientated alone its major and minor axes is given as,

The squared distance from a point on ellipse to a given point(*x*,*y*),

The stationary points at the zero points of its first order derivative of *t*,

This stationary condition is a quartic equation of cos *t*. With variable change *u* = cos *t*,

γ^{2}*u*^{4} − 2αγ*u*^{3} + (α^{2} + β^{2} − γ^{2})*u*^{2} + 2αγ*u* − α^{2} = 0

where α = 2*a**x*, β = 2*b**y*, and γ = 2(*a*^{2} − *b*^{2}).

For all solutions from the quartic equation, the minimum distance point is identified by the convex condition,

## Given a circle, construct a tangent circle passing two given points

Given a circle, the path of center of all tangent circles passing a given point is either an ellipse or a hyperbola. A quadratic form of either ellipse or hyperbola is constructed for each of the given points, and the center of the circle to be constructed in on the intersections of these two quadratic forms. After locating of the circle center, the radius is found by the distance from either of the given points to the center.

LibreCAD has a powerful general quadratic form framework to ease the construction of such quadratic forms and location of intersections between two quadratic forms.

## modular function in LibreCAD

the standard glibc fmod(x, a) is not convenient here, since we need a modular function work the same way for both positive and negative numbers, instead, we use,