Amenadiel\JpGraph\Util\Bezier

Complexity

Total Complexity

13

Size/Duplication

Total Lines	106
Duplicated Lines	0 %

Test Coverage

Coverage

98.15%

Importance

Changes	1
Bugs	0	Features	0

3 Methods

Rating	Name	Duplication	Size	Complexity
A	Get()	0	14	2
A	__construct()	0	21	6
A	GetPoint()	0	38	5

<?php

/**
 * JPGraph v4.0.3
 */

namespace Amenadiel\JpGraph\Util;

/**
 * @class Bezier
 * // Create a new data array from a number of control points
 */
class Bezier
{
    /**
     * @author Thomas Despoix, openXtrem company
     * @license released under QPL
     * @abstract Bezier interoplated point generation,
     * computed from control points data sets, based on Paul Bourke algorithm :
     * http://local.wasp.uwa.edu.au/~pbourke/geometry/bezier/index2.html
     */
    private $datax = [];
    private $datay = [];
    private $n     = 0;

    public function __construct($datax, $datay, $attraction_factor = 1)
    {
        // Adding control point multiple time will raise their attraction power over the curve
        $this->n = safe_count($datax);
        if ($this->n !== safe_count($datay)) {
            JpGraphError::RaiseL(19003);
            //('Bezier: Number of X and Y coordinates must be the same');
        }
        $idx = 0;
        foreach ($datax as $datumx) {
            for ($i = 0; $i < $attraction_factor; ++$i) {
                $this->datax[$idx++] = $datumx;
            }
        }
        $idx = 0;
        foreach ($datay as $datumy) {
            for ($i = 0; $i < $attraction_factor; ++$i) {
                $this->datay[$idx++] = $datumy;
            }
        }
        $this->n *= $attraction_factor;
    }

    /**
     * Return a set of data points that specifies the bezier curve with $steps points.
     *
     * @param $steps Number of new points to return
     *
     * @return array($datax, $datay)
     */
    public function Get($steps)
    {
        $datax = [];
        $datay = [];
        for ($i = 0; $i < $steps; ++$i) {
            list($datumx, $datumy) = $this->GetPoint((float) $i / (float) $steps);
            $datax[$i]             = $datumx;
            $datay[$i]             = $datumy;
        }

        $datax[] = end($this->datax);
        $datay[] = end($this->datay);

        return [$datax, $datay];
    }

    /**
     * Return one point on the bezier curve. $mu is the position on the curve where $mu is in the
     * range 0 $mu < 1 where 0 is tha start point and 1 is the end point. Note that every newly computed
     * point depends on all the existing points.
     *
     * @param $mu Position on the bezier curve
     *
     * @return array($x, $y)
     */
    public function GetPoint($mu)
    {
        $n     = $this->n - 1;
        $k     = 0;

The assignment to $k is dead and can be removed.

        $kn    = 0;

The assignment to $kn is dead and can be removed.

        $nn    = 0;

The assignment to $nn is dead and can be removed.

        $nkn   = 0;

The assignment to $nkn is dead and can be removed.

        $blend = 0.0;

The assignment to $blend is dead and can be removed.

        $newx  = 0.0;
        $newy  = 0.0;

        $muk  = 1.0;
        $munk = (float) pow(1 - $mu, (float) $n);

        for ($k = 0; $k <= $n; ++$k) {
            $nn    = $n;
            $kn    = $k;
            $nkn   = $n - $k;
            $blend = $muk * $munk;
            $muk *= $mu;
            $munk /= (1 - $mu);
            while ($nn >= 1) {
                $blend *= $nn;
                --$nn;
                if ($kn > 1) {
                    $blend /= (float) $kn;
                    --$kn;
                }
                if ($nkn > 1) {
                    $blend /= (float) $nkn;
                    --$nkn;
                }
            }
            $newx += $this->datax[$k] * $blend;
            $newy += $this->datay[$k] * $blend;
        }

        return [$newx, $newy];
    }
}