2018-11-24 15:01:06 -08:00
|
|
|
|
/*
|
|
|
|
|
|
Copyright (c) 2018, Lars Brubaker, John Lewin
|
|
|
|
|
|
All rights reserved.
|
|
|
|
|
|
|
|
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
|
|
|
|
modification, are permitted provided that the following conditions are met:
|
|
|
|
|
|
|
|
|
|
|
|
1. Redistributions of source code must retain the above copyright notice, this
|
|
|
|
|
|
list of conditions and the following disclaimer.
|
|
|
|
|
|
2. Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
|
|
this list of conditions and the following disclaimer in the documentation
|
|
|
|
|
|
and/or other materials provided with the distribution.
|
|
|
|
|
|
|
|
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
|
|
|
|
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
|
|
|
|
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
|
|
|
|
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
|
|
|
|
|
|
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
|
|
|
|
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
|
|
|
|
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
|
|
|
|
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
|
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
|
|
|
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
|
|
|
|
|
|
|
The views and conclusions contained in the software and documentation are those
|
|
|
|
|
|
of the authors and should not be interpreted as representing official policies,
|
|
|
|
|
|
either expressed or implied, of the FreeBSD Project.
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
2016-02-22 10:14:07 -08:00
|
|
|
|
using System;
|
2018-11-24 15:01:06 -08:00
|
|
|
|
using System.Collections.Generic;
|
|
|
|
|
|
using MatterHackers.VectorMath;
|
2021-03-05 15:07:50 -08:00
|
|
|
|
using MIConvexHull;
|
2014-06-06 16:05:18 -07:00
|
|
|
|
|
2018-11-24 15:01:06 -08:00
|
|
|
|
namespace MatterHackers.MatterControl.SlicerConfiguration
|
2014-06-06 16:05:18 -07:00
|
|
|
|
{
|
2015-04-08 15:20:10 -07:00
|
|
|
|
public class PrintLevelingData
|
|
|
|
|
|
{
|
2018-03-30 14:48:55 -07:00
|
|
|
|
public PrintLevelingData()
|
2016-04-27 19:12:15 -07:00
|
|
|
|
{
|
2015-04-08 15:20:10 -07:00
|
|
|
|
}
|
2016-02-22 10:14:07 -08:00
|
|
|
|
|
2018-11-24 15:06:44 -08:00
|
|
|
|
public List<Vector3> SampledPositions = new List<Vector3>();
|
|
|
|
|
|
|
|
|
|
|
|
public LevelingSystem LevelingSystem { get; set; }
|
|
|
|
|
|
|
|
|
|
|
|
public DateTime CreationDate { get; set; }
|
|
|
|
|
|
|
|
|
|
|
|
public double BedTemperature { get; set; }
|
|
|
|
|
|
|
|
|
|
|
|
public bool IssuedLevelingTempWarning { get; set; }
|
|
|
|
|
|
|
2017-06-07 15:56:02 -07:00
|
|
|
|
public bool SamplesAreSame(List<Vector3> sampledPositions)
|
|
|
|
|
|
{
|
|
|
|
|
|
if (sampledPositions.Count == SampledPositions.Count)
|
|
|
|
|
|
{
|
|
|
|
|
|
for (int i = 0; i < sampledPositions.Count; i++)
|
|
|
|
|
|
{
|
|
|
|
|
|
if (sampledPositions[i] != SampledPositions[i])
|
|
|
|
|
|
{
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
2021-03-05 15:07:50 -08:00
|
|
|
|
|
|
|
|
|
|
public IEnumerable<(Vector3 v0, Vector3 v1, Vector3 v2)> GetLevelingTriangles()
|
|
|
|
|
|
{
|
|
|
|
|
|
// get the delaunay triangulation
|
|
|
|
|
|
var zDictionary = new Dictionary<(double, double), double>();
|
|
|
|
|
|
var vertices = new List<DefaultVertex>();
|
|
|
|
|
|
|
|
|
|
|
|
if (SampledPositions.Count > 2)
|
|
|
|
|
|
{
|
|
|
|
|
|
foreach (var sample in SampledPositions)
|
|
|
|
|
|
{
|
|
|
|
|
|
vertices.Add(new DefaultVertex()
|
|
|
|
|
|
{
|
|
|
|
|
|
Position = new double[] { sample.X, sample.Y }
|
|
|
|
|
|
});
|
|
|
|
|
|
var key = (sample.X, sample.Y);
|
|
|
|
|
|
if (!zDictionary.ContainsKey(key))
|
|
|
|
|
|
{
|
|
|
|
|
|
zDictionary.Add(key, sample.Z);
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
else
|
|
|
|
|
|
{
|
|
|
|
|
|
vertices.Add(new DefaultVertex()
|
|
|
|
|
|
{
|
|
|
|
|
|
Position = new double[] { 0, 0 }
|
|
|
|
|
|
});
|
|
|
|
|
|
zDictionary.Add((0, 0), 0);
|
|
|
|
|
|
|
|
|
|
|
|
vertices.Add(new DefaultVertex()
|
|
|
|
|
|
{
|
|
|
|
|
|
Position = new double[] { 200, 0 }
|
|
|
|
|
|
});
|
|
|
|
|
|
zDictionary.Add((200, 0), 0);
|
|
|
|
|
|
|
|
|
|
|
|
vertices.Add(new DefaultVertex()
|
|
|
|
|
|
{
|
|
|
|
|
|
Position = new double[] { 100, 200 }
|
|
|
|
|
|
});
|
|
|
|
|
|
zDictionary.Add((100, 200), 0);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int extraXPosition = -50000;
|
|
|
|
|
|
vertices.Add(new DefaultVertex()
|
|
|
|
|
|
{
|
|
|
|
|
|
Position = new double[] { extraXPosition, vertices[0].Position[1] }
|
|
|
|
|
|
});
|
|
|
|
|
|
|
2021-12-15 18:09:21 -08:00
|
|
|
|
var positions = new List<(Vector3, Vector3, Vector3)>();
|
|
|
|
|
|
try
|
2021-03-05 15:07:50 -08:00
|
|
|
|
{
|
2021-12-15 18:09:21 -08:00
|
|
|
|
var triangles = DelaunayTriangulation<DefaultVertex, DefaultTriangulationCell<DefaultVertex>>.Create(vertices, .001);
|
|
|
|
|
|
|
|
|
|
|
|
// make all the triangle planes for these triangles
|
|
|
|
|
|
foreach (var triangle in triangles.Cells)
|
2021-03-05 15:07:50 -08:00
|
|
|
|
{
|
2021-12-15 18:09:21 -08:00
|
|
|
|
var p0 = triangle.Vertices[0].Position;
|
|
|
|
|
|
var p1 = triangle.Vertices[1].Position;
|
|
|
|
|
|
var p2 = triangle.Vertices[2].Position;
|
|
|
|
|
|
if (p0[0] != extraXPosition && p1[0] != extraXPosition && p2[0] != extraXPosition)
|
|
|
|
|
|
{
|
|
|
|
|
|
var v0 = new Vector3(p0[0], p0[1], zDictionary[(p0[0], p0[1])]);
|
|
|
|
|
|
var v1 = new Vector3(p1[0], p1[1], zDictionary[(p1[0], p1[1])]);
|
|
|
|
|
|
var v2 = new Vector3(p2[0], p2[1], zDictionary[(p2[0], p2[1])]);
|
|
|
|
|
|
// add all the regions
|
|
|
|
|
|
positions.Add((v0, v1, v2));
|
|
|
|
|
|
}
|
2021-03-05 15:07:50 -08:00
|
|
|
|
}
|
|
|
|
|
|
}
|
2021-12-15 18:09:21 -08:00
|
|
|
|
catch
|
|
|
|
|
|
{
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
foreach(var position in positions)
|
|
|
|
|
|
{
|
|
|
|
|
|
yield return position;
|
|
|
|
|
|
}
|
2021-03-05 15:07:50 -08:00
|
|
|
|
}
|
2021-12-15 18:09:21 -08:00
|
|
|
|
}
|
2015-04-08 15:20:10 -07:00
|
|
|
|
}
|