VoxelRayTrace.php

<?php
 
/*
 *
 *  ____            _        _   __  __ _                  __  __ ____
 * |  _ \ ___   ___| | _____| |_|  \/  (_)_ __   ___      |  \/  |  _ \
 * | |_) / _ \ / __| |/ / _ \ __| |\/| | | '_ \ / _ \_____| |\/| | |_) |
 * |  __/ (_) | (__|   <  __/ |_| |  | | | | | |  __/_____| |  | |  __/
 * |_|   \___/ \___|_|\_\___|\__|_|  |_|_|_| |_|\___|     |_|  |_|_|
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * @author PocketMine Team
 * @link http://www.pocketmine.net/
 *
 *
*/
 
declare(strict_types=1);
 
namespace pocketmine\math;
 
use function floatval;
use function floor;
use const INF;
 
final class VoxelRayTrace{
    private function __construct(){
        //NOOP
    }
 
    public static function inDirection(Vector3 $start, Vector3 $directionVector, float $maxDistance) : \Generator{
        return self::betweenPoints($start, $start->addVector($directionVector->multiply($maxDistance)));
    }
 
    public static function betweenPoints(Vector3 $start, Vector3 $end) : \Generator{
        $currentBlock = $start->floor();
 
        $directionVector = $end->subtractVector($start)->normalize();
        if($directionVector->lengthSquared() <= 0){
            throw new \InvalidArgumentException("Start and end points are the same, giving a zero direction vector");
        }
 
        $radius = $start->distance($end);
 
        $stepX = $directionVector->x <=> 0;
        $stepY = $directionVector->y <=> 0;
        $stepZ = $directionVector->z <=> 0;
 
        //Initialize the step accumulation variables depending how far into the current block the start position is. If
        //the start position is on the corner of the block, these will be zero.
        $tMaxX = self::distanceFactorToBoundary($start->x, $directionVector->x);
        $tMaxY = self::distanceFactorToBoundary($start->y, $directionVector->y);
        $tMaxZ = self::distanceFactorToBoundary($start->z, $directionVector->z);
 
        //The change in t on each axis when taking a step on that axis (always positive).
        $tDeltaX = floatval($directionVector->x) === 0.0 ? 0 : $stepX / $directionVector->x;
        $tDeltaY = floatval($directionVector->y) === 0.0 ? 0 : $stepY / $directionVector->y;
        $tDeltaZ = floatval($directionVector->z) === 0.0 ? 0 : $stepZ / $directionVector->z;
 
        while(true){
            yield $currentBlock;
 
            // tMaxX stores the t-value at which we cross a cube boundary along the
            // X axis, and similarly for Y and Z. Therefore, choosing the least tMax
            // chooses the closest cube boundary.
            if($tMaxX < $tMaxY and $tMaxX < $tMaxZ){
                if($tMaxX > $radius){
                    break;
                }
                $currentBlock = $currentBlock->add($stepX, 0, 0);
                $tMaxX += $tDeltaX;
            }elseif($tMaxY < $tMaxZ){
                if($tMaxY > $radius){
                    break;
                }
                $currentBlock = $currentBlock->add(0, $stepY, 0);
                $tMaxY += $tDeltaY;
            }else{
                if($tMaxZ > $radius){
                    break;
                }
                $currentBlock = $currentBlock->add(0, 0, $stepZ);
                $tMaxZ += $tDeltaZ;
            }
        }
    }
 
    private static function distanceFactorToBoundary(float $s, float $ds) : float{
        if($ds === 0.0){
            return INF;
        }
 
        return $ds < 0 ?
            ($s - floor($s)) / -$ds :
            (1 - ($s - floor($s))) / $ds;
    }
}