The function circumcircle takes input as the coordinates of the three vertices of a triangle and compute the circum center and circum radius by using the formula in terms of the length of sides and area of triangle and plot the circumcircle.
DDA algorithm uses fast interpolation and rounding method to implement rasterization of lines, triangle and polygons. This technique has been used here to produce a straight line.
The algorithm of Karge Thompson is a heuristic algorithm that allows to obtain, given a specific group of jobs to be produced, the best sequence in terms of time setup.
Hypothesis:
N indipendent jobs;
delivery...
3-mscripts for generation of Fern, Triangle, Dragon standard fractals, and 2 additional mscripts for generation of hexagon and pentagram based fractals, all with introductory information contained in PDF document.
This contribution provides functions for finding an optimum parameter set using the evolutionary algorithm of Differential Evolution. Simply speaking: If you have some complicated function of which you are unable to compute a derivative, and you...
In my following book, I derived the algorithm of constructing the parity check matrices of IEEE 802.16e LDPC. [1] Y. Xiao, Turbo and LDPC Codecs and their Applications, Press of Posts and Telecommunications, Beijing, 2010. This program...
Assess the quality of a triangle mesh using a simple indicator.
Plug in three coordinates to triArea(a,b,c), and it will return the area of the triangle. some common variable letters transfer into these meanings: m: slope y,c: y intercept a: x's coefficient b: y's coefficient
A reimplementation of the CSSR algorithm of Shalizi et al. Extends the input data from discrete to continuous clustered by way of a novel discretisation scheme. Allows users to infer optimally predictive hidden Markov models from their data,...
How to use tritrig: tritrig is in the form 'tritrig(a,b,c,A,B,C)' where a b c A B C are the angles and the lengths of a triangle. If your triangle has a right angle in it, it must be 'C' and the hypotenuse must be 'c'. The angles...
Program for global minimization of a concave function. We implement the algorithm of Harold. P Benson which can be found in the paper " A Branch and Bound-Outer Approximation Algorithm for Concave Minimization over a Convex...
Implementation of the algorithm proposed in the paper:
Morhac, M., 1991 - A Fast Algorithm of Nonlinear Volterra Filtering
Basically, the output of each n-homogeneous subsystem is decomposed into a summation of convolutions....
This simple function use three points as input which can be 2D,3D...nD. And will calculate the area and angles of this triangle / polygon.
The last version also support the precise 'Orthogonal-triangular decomposition' area calculation...
This is a small program that shows the diagram of C source that is similar to Flowchart. This program may help the user analyze the algorithm of source.
%inside_triangle is used to check if a point P is inside %the triangle P1P2P3 or not. % %Inputs: P, P1, P2 and P3 are vectors of length 2 or three of the % form [x y z] or [x y] % %Output: True %True=1 => P is...
These files help to map a set of points to a set of edges and arcs. This maybe interesting for matching GPS coordinates to infrastructure plans.
The simple algorithme was taken from
Journal of the Eastern Asia Society...
In this present work, we present an algorithm for path planning to a target for mobile robot in unknown environment. The proposed algorithm allows a mobile robot to navigate through static obstacles, and finding the path in order to reach the...
SIMPLETRACKER a simple particle tracking algorithm that can deal with gaps *Tracking* , or particle linking, consist in re-building the trajectories of one or several particles as they move along time. Their position is ...
Q = MULTIQUAD(F,S) approximates the S-dimensional integral of a function F(X) over the unit cube, with 3 <= S <= 8. [Q,E] = MULTIQUAD(F,S) returns an estimate of the error. [Q,E] = MULTIQUAD(F,S,ORDER) uses approximately...
This function is provided to extract geometric properties of a volume array that has been thresholded and characterized by a patch (of triangular faces) generated by isosurface(). Its purpose is to calculate the area of a nerve cell dendrite, and... |