Added KD tree
This commit is contained in:
73
Runtime/KDTree/KDBounds.cs
Normal file
73
Runtime/KDTree/KDBounds.cs
Normal file
@@ -0,0 +1,73 @@
|
||||
/*MIT License
|
||||
|
||||
Copyright(c) 2018 Vili Volčini / viliwonka
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||
of this software and associated documentation files (the "Software"), to deal
|
||||
in the Software without restriction, including without limitation the rights
|
||||
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is
|
||||
furnished to do so, subject to the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all
|
||||
copies or substantial portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
||||
SOFTWARE.
|
||||
*/
|
||||
|
||||
using UnityEngine;
|
||||
using UnityEditor;
|
||||
|
||||
namespace DataStructures.ViliWonka.KDTree {
|
||||
|
||||
public struct KDBounds {
|
||||
|
||||
public Vector3 min;
|
||||
public Vector3 max;
|
||||
|
||||
public Vector3 size {
|
||||
|
||||
get {
|
||||
return max - min;
|
||||
}
|
||||
}
|
||||
|
||||
// returns unity bounds
|
||||
public Bounds Bounds {
|
||||
|
||||
get {
|
||||
return new Bounds(
|
||||
(min + max) / 2,
|
||||
(max - min)
|
||||
);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
public Vector3 ClosestPoint(Vector3 point) {
|
||||
|
||||
// X axis
|
||||
if(point.x < min.x) point.x = min.x;
|
||||
else
|
||||
if(point.x > max.x) point.x = max.x;
|
||||
|
||||
// Y axis
|
||||
if(point.y < min.y) point.y = min.y;
|
||||
else
|
||||
if(point.y > max.y) point.y = max.y;
|
||||
|
||||
// Z axis
|
||||
if(point.z < min.z) point.z = min.z;
|
||||
else
|
||||
if(point.z > max.z) point.z = max.z;
|
||||
|
||||
return point;
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user