2019-01-22 11:35:47 -08:00
|
|
|
|
/*
|
|
|
|
|
|
Copyright (c) 2019, 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.
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
using System;
|
|
|
|
|
|
using System.Collections.Generic;
|
|
|
|
|
|
using System.Linq;
|
|
|
|
|
|
using System.Threading;
|
|
|
|
|
|
using System.Threading.Tasks;
|
|
|
|
|
|
using MatterHackers.Agg;
|
2019-01-23 12:00:38 -08:00
|
|
|
|
using MatterHackers.Agg.Image;
|
2019-01-22 11:35:47 -08:00
|
|
|
|
using MatterHackers.DataConverters3D;
|
2019-01-24 09:09:44 -08:00
|
|
|
|
using MatterHackers.MatterControl.PartPreviewWindow;
|
2019-01-22 11:35:47 -08:00
|
|
|
|
using MatterHackers.PolygonMesh;
|
|
|
|
|
|
using MatterHackers.RayTracer;
|
|
|
|
|
|
using MatterHackers.VectorMath;
|
|
|
|
|
|
|
|
|
|
|
|
namespace MatterHackers.MatterControl.DesignTools
|
|
|
|
|
|
{
|
|
|
|
|
|
public static class FaceListExtensions
|
|
|
|
|
|
{
|
|
|
|
|
|
public static IPrimitive CreateTraceData(this FaceList faceList, List<Vector3> vertexList, int maxRecursion = int.MaxValue)
|
|
|
|
|
|
{
|
|
|
|
|
|
var allPolys = new List<IPrimitive>();
|
|
|
|
|
|
|
|
|
|
|
|
foreach (var face in faceList)
|
|
|
|
|
|
{
|
|
|
|
|
|
allPolys.Add(new TriangleShape(vertexList[face.v0], vertexList[face.v1], vertexList[face.v2], null));
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return BoundingVolumeHierarchy.CreateNewHierachy(allPolys, maxRecursion);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
public static IPrimitive CreateTraceData(this FaceList faceList, List<Vector3Float> vertexList, int maxRecursion = int.MaxValue)
|
|
|
|
|
|
{
|
|
|
|
|
|
var allPolys = new List<IPrimitive>();
|
|
|
|
|
|
|
|
|
|
|
|
foreach (var face in faceList)
|
|
|
|
|
|
{
|
|
|
|
|
|
allPolys.Add(new TriangleShape(vertexList[face.v0], vertexList[face.v1], vertexList[face.v2], null));
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return BoundingVolumeHierarchy.CreateNewHierachy(allPolys, maxRecursion);
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
[HideFromTreeViewAttribute, Immutable]
|
|
|
|
|
|
public class GeneratedSupportObject3D : Object3D
|
|
|
|
|
|
{
|
|
|
|
|
|
public GeneratedSupportObject3D()
|
|
|
|
|
|
{
|
|
|
|
|
|
OutputType = PrintOutputTypes.Support;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
public class SupportGenerator
|
|
|
|
|
|
{
|
2019-04-15 13:40:31 -07:00
|
|
|
|
private double minimumSupportHeight;
|
2019-04-22 13:25:52 -07:00
|
|
|
|
private readonly InteractiveScene scene;
|
2019-01-22 11:35:47 -08:00
|
|
|
|
|
2019-03-29 10:10:39 -07:00
|
|
|
|
public SupportGenerator(InteractiveScene scene, double minimumSupportHeight)
|
2019-01-22 11:35:47 -08:00
|
|
|
|
{
|
2019-03-29 10:10:39 -07:00
|
|
|
|
this.minimumSupportHeight = minimumSupportHeight;
|
2019-01-22 11:35:47 -08:00
|
|
|
|
this.scene = scene;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2019-04-22 13:25:52 -07:00
|
|
|
|
public enum SupportGenerationType
|
|
|
|
|
|
{
|
|
|
|
|
|
Normal,
|
|
|
|
|
|
From_Bed
|
|
|
|
|
|
}
|
2019-01-23 16:08:27 -08:00
|
|
|
|
|
2019-01-22 11:35:47 -08:00
|
|
|
|
public double MaxOverHangAngle
|
|
|
|
|
|
{
|
|
|
|
|
|
get
|
|
|
|
|
|
{
|
|
|
|
|
|
if (UserSettings.Instance.get(UserSettingsKey.SupportMaxOverHangAngle) == null)
|
|
|
|
|
|
{
|
|
|
|
|
|
return 45;
|
|
|
|
|
|
}
|
2019-04-22 13:25:52 -07:00
|
|
|
|
|
2019-01-22 11:35:47 -08:00
|
|
|
|
var value = UserSettings.Instance.GetValue<double>(UserSettingsKey.SupportMaxOverHangAngle);
|
|
|
|
|
|
if (value < 0)
|
|
|
|
|
|
{
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
2019-04-22 13:25:52 -07:00
|
|
|
|
|
2019-01-22 11:35:47 -08:00
|
|
|
|
if (value > 90)
|
|
|
|
|
|
{
|
|
|
|
|
|
value = 90;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return value;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
set
|
|
|
|
|
|
{
|
|
|
|
|
|
UserSettings.Instance.set(UserSettingsKey.SupportMaxOverHangAngle, value.ToString());
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
public double PillarSize
|
|
|
|
|
|
{
|
|
|
|
|
|
get
|
|
|
|
|
|
{
|
|
|
|
|
|
var value = UserSettings.Instance.GetValue<double>(UserSettingsKey.SupportPillarSize);
|
|
|
|
|
|
if (value < 1.5)
|
|
|
|
|
|
{
|
|
|
|
|
|
return 1.5;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return value;
|
|
|
|
|
|
}
|
2019-04-22 13:25:52 -07:00
|
|
|
|
|
2019-01-22 11:35:47 -08:00
|
|
|
|
set
|
|
|
|
|
|
{
|
|
|
|
|
|
UserSettings.Instance.set(UserSettingsKey.SupportPillarSize, value.ToString());
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2019-01-23 16:08:27 -08:00
|
|
|
|
public SupportGenerationType SupportType
|
2019-01-23 12:00:38 -08:00
|
|
|
|
{
|
2019-01-23 16:08:27 -08:00
|
|
|
|
get
|
2019-01-23 12:00:38 -08:00
|
|
|
|
{
|
2019-01-23 16:08:27 -08:00
|
|
|
|
var supportString = UserSettings.Instance.get(UserSettingsKey.SupportGenerationType);
|
|
|
|
|
|
if (Enum.TryParse(supportString, out SupportGenerationType supportType))
|
2019-01-23 12:00:38 -08:00
|
|
|
|
{
|
2019-01-23 16:08:27 -08:00
|
|
|
|
return supportType;
|
2019-01-23 12:00:38 -08:00
|
|
|
|
}
|
2019-01-23 16:08:27 -08:00
|
|
|
|
|
|
|
|
|
|
return SupportGenerationType.Normal;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
set
|
|
|
|
|
|
{
|
|
|
|
|
|
UserSettings.Instance.set(UserSettingsKey.SupportGenerationType, value.ToString());
|
2019-01-23 12:00:38 -08:00
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2019-01-23 16:08:27 -08:00
|
|
|
|
/// <summary>
|
2019-04-22 13:25:52 -07:00
|
|
|
|
/// Gets the amount to reduce the pillars so they are separated in the 3D view.
|
2019-01-23 16:08:27 -08:00
|
|
|
|
/// </summary>
|
2019-04-05 16:35:28 -07:00
|
|
|
|
public static double ColumnReduceAmount => 1;
|
2019-01-23 16:08:27 -08:00
|
|
|
|
|
2019-01-22 11:35:47 -08:00
|
|
|
|
public Task Create(IProgress<ProgressStatus> progress, CancellationToken cancelationToken)
|
|
|
|
|
|
{
|
2019-03-28 16:04:17 -07:00
|
|
|
|
var selectedItem = scene.SelectedItem;
|
|
|
|
|
|
|
2019-03-29 10:10:39 -07:00
|
|
|
|
using (new SelectionMaintainer(scene))
|
2019-01-22 11:35:47 -08:00
|
|
|
|
{
|
2019-04-22 13:25:52 -07:00
|
|
|
|
var status = new ProgressStatus
|
|
|
|
|
|
{
|
|
|
|
|
|
Status = "Enter"
|
|
|
|
|
|
};
|
2019-03-29 10:10:39 -07:00
|
|
|
|
progress?.Report(status);
|
2019-01-22 11:35:47 -08:00
|
|
|
|
|
2019-04-22 13:25:52 -07:00
|
|
|
|
// Get visible meshes for each of them
|
2019-03-29 15:23:53 -07:00
|
|
|
|
var allBedItems = scene.Children.SelectMany(i => i.VisibleMeshes());
|
2019-03-29 10:10:39 -07:00
|
|
|
|
|
2019-04-22 13:25:52 -07:00
|
|
|
|
var suppoortBounds = AxisAlignedBoundingBox.Empty();
|
2019-03-29 10:10:39 -07:00
|
|
|
|
if (selectedItem != null)
|
2019-01-23 12:00:38 -08:00
|
|
|
|
{
|
2019-03-29 15:23:53 -07:00
|
|
|
|
foreach (var candidate in selectedItem.VisibleMeshes())
|
|
|
|
|
|
{
|
|
|
|
|
|
suppoortBounds += candidate.GetAxisAlignedBoundingBox(candidate.Matrix.Inverted * candidate.WorldMatrix());
|
|
|
|
|
|
}
|
2019-03-29 10:10:39 -07:00
|
|
|
|
}
|
2019-03-29 15:23:53 -07:00
|
|
|
|
else
|
2019-03-29 10:10:39 -07:00
|
|
|
|
{
|
2019-03-29 15:23:53 -07:00
|
|
|
|
foreach (var candidate in allBedItems)
|
|
|
|
|
|
{
|
|
|
|
|
|
suppoortBounds += candidate.GetAxisAlignedBoundingBox(candidate.Matrix.Inverted * candidate.WorldMatrix());
|
|
|
|
|
|
}
|
2019-03-29 10:10:39 -07:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// create the gird of possible support
|
2019-03-29 15:23:53 -07:00
|
|
|
|
var gridBounds = new RectangleDouble(Math.Floor((double)(suppoortBounds.MinXYZ.X / PillarSize)),
|
|
|
|
|
|
Math.Floor((double)(suppoortBounds.MinXYZ.Y / PillarSize)),
|
|
|
|
|
|
Math.Ceiling(suppoortBounds.MaxXYZ.X / PillarSize),
|
|
|
|
|
|
Math.Ceiling(suppoortBounds.MaxXYZ.Y / PillarSize));
|
2019-03-29 10:10:39 -07:00
|
|
|
|
var partBounds = new RectangleDouble(gridBounds.Left * PillarSize,
|
|
|
|
|
|
gridBounds.Bottom * PillarSize,
|
|
|
|
|
|
gridBounds.Right * PillarSize,
|
|
|
|
|
|
gridBounds.Top * PillarSize);
|
|
|
|
|
|
|
|
|
|
|
|
int gridWidth = (int)gridBounds.Width;
|
|
|
|
|
|
int gridHeight = (int)gridBounds.Height;
|
|
|
|
|
|
var supportGrid = new List<List<List<(bool isBottom, double z)>>>();
|
|
|
|
|
|
for (int x = 0; x < gridWidth; x++)
|
|
|
|
|
|
{
|
|
|
|
|
|
supportGrid.Add(new List<List<(bool, double)>>());
|
|
|
|
|
|
for (int y = 0; y < gridHeight; y++)
|
|
|
|
|
|
{
|
|
|
|
|
|
supportGrid[x].Add(new List<(bool, double)>());
|
|
|
|
|
|
}
|
2019-01-23 12:00:38 -08:00
|
|
|
|
}
|
2019-01-22 11:35:47 -08:00
|
|
|
|
|
2019-03-29 10:10:39 -07:00
|
|
|
|
// get all the support plane intersections
|
|
|
|
|
|
status.Status = "Trace";
|
|
|
|
|
|
progress?.Report(status);
|
2019-03-29 15:23:53 -07:00
|
|
|
|
var detectedPlanes = DetectRequiredSupportByTracing(gridBounds, allBedItems);
|
2019-01-23 14:23:27 -08:00
|
|
|
|
|
2019-03-29 10:10:39 -07:00
|
|
|
|
status.Status = "Columns";
|
|
|
|
|
|
progress?.Report(status);
|
2019-01-23 14:23:27 -08:00
|
|
|
|
|
2019-03-29 10:10:39 -07:00
|
|
|
|
// minimum height requiring support is 1/2 the layer height
|
|
|
|
|
|
AddSupportColumns(gridBounds, detectedPlanes);
|
2019-01-23 14:23:27 -08:00
|
|
|
|
|
2019-03-29 10:10:39 -07:00
|
|
|
|
// this is the theory for regions rather than pillars
|
|
|
|
|
|
// separate the faces into face patch groups (these are the new support tops)
|
|
|
|
|
|
// project all the vertices of each patch group down until they hit an up face in the scene (or 0)
|
|
|
|
|
|
// make a new patch group at the z of the hit (these will be the bottoms)
|
|
|
|
|
|
// find the outline of the patch groups (these will be the walls of the top and bottom patches
|
|
|
|
|
|
// make a new mesh object with the top, bottom and walls, add it to the scene and mark it as support
|
2019-01-23 14:23:27 -08:00
|
|
|
|
|
2019-03-29 10:10:39 -07:00
|
|
|
|
return Task.CompletedTask;
|
|
|
|
|
|
}
|
2019-01-23 14:23:27 -08:00
|
|
|
|
}
|
|
|
|
|
|
|
2019-01-23 16:08:27 -08:00
|
|
|
|
public void RemoveExisting()
|
2019-01-23 14:23:27 -08:00
|
|
|
|
{
|
2019-03-29 10:10:39 -07:00
|
|
|
|
var selectedItem = scene.SelectedItem;
|
|
|
|
|
|
var bedBounds = new RectangleDouble(Vector2.NegativeInfinity, Vector2.PositiveInfinity);
|
2019-04-15 13:40:31 -07:00
|
|
|
|
if (selectedItem != null)
|
2019-03-29 10:10:39 -07:00
|
|
|
|
{
|
|
|
|
|
|
var aabb = selectedItem.GetAxisAlignedBoundingBox();
|
|
|
|
|
|
bedBounds = new RectangleDouble(new Vector2(aabb.MinXYZ), new Vector2(aabb.MaxXYZ));
|
|
|
|
|
|
}
|
2019-01-23 14:23:27 -08:00
|
|
|
|
|
2019-03-29 10:10:39 -07:00
|
|
|
|
using (new SelectionMaintainer(scene))
|
|
|
|
|
|
{
|
|
|
|
|
|
var existingSupports = scene.Descendants().Where(i =>
|
|
|
|
|
|
{
|
2019-04-15 13:40:31 -07:00
|
|
|
|
if (i.GetType() == typeof(GeneratedSupportObject3D))
|
2019-03-29 10:10:39 -07:00
|
|
|
|
{
|
|
|
|
|
|
// we have a support, check if it is within the bounds of the selected object
|
|
|
|
|
|
var xyCenter = new Vector2(i.GetAxisAlignedBoundingBox().Center);
|
|
|
|
|
|
if (bedBounds.Contains(xyCenter))
|
|
|
|
|
|
{
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return false;
|
|
|
|
|
|
});
|
|
|
|
|
|
|
|
|
|
|
|
scene.UndoBuffer.AddAndDo(new DeleteCommand(scene, existingSupports.ToList()));
|
|
|
|
|
|
}
|
2019-01-23 14:23:27 -08:00
|
|
|
|
}
|
|
|
|
|
|
|
2019-01-23 16:08:27 -08:00
|
|
|
|
public bool RequiresSupport()
|
2019-01-23 14:23:27 -08:00
|
|
|
|
{
|
2019-01-23 16:08:27 -08:00
|
|
|
|
bool supportInScene = scene.VisibleMeshes().Any(i => i.WorldOutputType() == PrintOutputTypes.Support);
|
|
|
|
|
|
if (!supportInScene)
|
2019-01-23 14:23:27 -08:00
|
|
|
|
{
|
2019-01-23 16:08:27 -08:00
|
|
|
|
// there is no support in the scene check if there are faces that require support
|
|
|
|
|
|
var supportCandidates = scene.VisibleMeshes().Where(i => i.OutputType != PrintOutputTypes.Support);
|
|
|
|
|
|
|
|
|
|
|
|
// find all the faces that are candidates for support
|
|
|
|
|
|
foreach (var item in supportCandidates)
|
|
|
|
|
|
{
|
|
|
|
|
|
var matrix = item.WorldMatrix(scene);
|
|
|
|
|
|
for (int faceIndex = 0; faceIndex < item.Mesh.Faces.Count; faceIndex++)
|
|
|
|
|
|
{
|
|
|
|
|
|
bool aboveBed = false;
|
|
|
|
|
|
var face = item.Mesh.Faces[faceIndex];
|
|
|
|
|
|
var verts = new int[] { face.v0, face.v1, face.v2 };
|
|
|
|
|
|
foreach (var vertex in verts)
|
|
|
|
|
|
{
|
|
|
|
|
|
if (item.Mesh.Vertices[vertex].Transform(matrix).Z > .01)
|
|
|
|
|
|
{
|
|
|
|
|
|
aboveBed = true;
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
2019-04-22 13:25:52 -07:00
|
|
|
|
|
2019-01-23 16:08:27 -08:00
|
|
|
|
if (aboveBed)
|
|
|
|
|
|
{
|
|
|
|
|
|
var face0Normal = item.Mesh.Faces[faceIndex].normal.TransformNormal(matrix).GetNormal();
|
|
|
|
|
|
var angle = MathHelper.RadiansToDegrees(Math.Acos(face0Normal.Dot(-Vector3Float.UnitZ)));
|
|
|
|
|
|
|
|
|
|
|
|
if (angle < MaxOverHangAngle)
|
|
|
|
|
|
{
|
|
|
|
|
|
// TODO: consider how much area all supported polygons represent
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
2019-01-23 14:23:27 -08:00
|
|
|
|
}
|
|
|
|
|
|
|
2019-01-23 16:08:27 -08:00
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
private void AddSupportColumn(IObject3D holder, double gridX, double gridY, double bottomZ, double topZ)
|
|
|
|
|
|
{
|
|
|
|
|
|
if (topZ - bottomZ < .01)
|
2019-01-23 14:23:27 -08:00
|
|
|
|
{
|
2019-01-23 16:08:27 -08:00
|
|
|
|
// less than 10 micros high, don't ad it
|
|
|
|
|
|
return;
|
2019-01-23 14:23:27 -08:00
|
|
|
|
}
|
2019-04-22 13:25:52 -07:00
|
|
|
|
|
2019-01-23 16:08:27 -08:00
|
|
|
|
var support = new GeneratedSupportObject3D()
|
|
|
|
|
|
{
|
|
|
|
|
|
Mesh = PlatonicSolids.CreateCube(1, 1, 1)
|
|
|
|
|
|
};
|
2019-04-05 16:35:28 -07:00
|
|
|
|
// make it just a bit small so they always overlap correctly
|
|
|
|
|
|
var reduceAmount = ColumnReduceAmount * .99;
|
2019-01-23 16:08:27 -08:00
|
|
|
|
support.Matrix = Matrix4X4.CreateScale(PillarSize - reduceAmount, PillarSize - reduceAmount, topZ - bottomZ)
|
|
|
|
|
|
* Matrix4X4.CreateTranslation(gridX, gridY, bottomZ + (topZ - bottomZ) / 2);
|
2019-01-23 14:23:27 -08:00
|
|
|
|
|
2019-01-23 16:08:27 -08:00
|
|
|
|
holder.Children.Add(support);
|
2019-01-23 14:23:27 -08:00
|
|
|
|
}
|
2019-01-22 11:35:47 -08:00
|
|
|
|
|
2019-04-22 13:25:52 -07:00
|
|
|
|
private void AddSupportColumns(RectangleDouble gridBounds, Dictionary<(int x, int y), HitPlanes> detectedPlanes)
|
2019-01-23 14:23:27 -08:00
|
|
|
|
{
|
2019-01-23 12:00:38 -08:00
|
|
|
|
IObject3D supportColumnsToAdd = new Object3D();
|
2019-01-23 16:08:27 -08:00
|
|
|
|
bool fromBed = SupportType == SupportGenerationType.From_Bed;
|
|
|
|
|
|
var halfPillar = PillarSize / 2;
|
2019-01-23 14:23:27 -08:00
|
|
|
|
foreach (var kvp in detectedPlanes)
|
|
|
|
|
|
{
|
2019-03-29 10:10:39 -07:00
|
|
|
|
var planes = kvp.Value;
|
|
|
|
|
|
|
|
|
|
|
|
if (planes.Count == 0)
|
2019-01-23 14:23:27 -08:00
|
|
|
|
{
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2019-03-29 10:10:39 -07:00
|
|
|
|
planes.Sort((a, b) =>
|
2019-01-23 14:23:27 -08:00
|
|
|
|
{
|
2019-04-22 13:25:52 -07:00
|
|
|
|
return a.Z.CompareTo(b.Z);
|
2019-01-23 14:23:27 -08:00
|
|
|
|
});
|
|
|
|
|
|
|
2019-01-23 16:08:27 -08:00
|
|
|
|
var yPos = (gridBounds.Bottom + kvp.Key.y) * PillarSize + halfPillar;
|
|
|
|
|
|
var xPos = (gridBounds.Left + kvp.Key.x) * PillarSize + halfPillar;
|
2019-01-23 14:23:27 -08:00
|
|
|
|
|
|
|
|
|
|
if (fromBed)
|
|
|
|
|
|
{
|
2019-04-22 13:25:52 -07:00
|
|
|
|
var nextPlaneIsBottom = planes.Count > 1 && planes[1].Bottom;
|
2019-03-29 10:10:39 -07:00
|
|
|
|
if (!nextPlaneIsBottom // if the next plane is a top, we don't have any space from the bed to the part to put support
|
2019-04-22 13:25:52 -07:00
|
|
|
|
|| planes[1].Z > minimumSupportHeight) // if the next plane is a bottom and is not far enough away, there is no space to put any support
|
2019-01-23 14:23:27 -08:00
|
|
|
|
{
|
2019-04-22 13:25:52 -07:00
|
|
|
|
var firstBottomAboveBed = planes.GetNextBottom(0, minimumSupportHeight);
|
2019-03-28 16:04:17 -07:00
|
|
|
|
|
2019-04-10 17:01:21 -07:00
|
|
|
|
if (firstBottomAboveBed >= 0)
|
2019-03-28 16:04:17 -07:00
|
|
|
|
{
|
2019-04-22 13:25:52 -07:00
|
|
|
|
AddSupportColumn(supportColumnsToAdd, xPos, yPos, 0, planes[firstBottomAboveBed].Z + .01);
|
2019-03-28 16:04:17 -07:00
|
|
|
|
}
|
2019-01-23 14:23:27 -08:00
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
else
|
|
|
|
|
|
{
|
2019-03-28 16:04:17 -07:00
|
|
|
|
int i = 0;
|
2019-01-23 14:23:27 -08:00
|
|
|
|
double lastTopZ = 0;
|
2019-04-10 17:01:21 -07:00
|
|
|
|
int lastBottom = -1;
|
2019-04-22 13:25:52 -07:00
|
|
|
|
var nextPlaneIsBottom = planes.Count > 1 && planes[1].Bottom;
|
2019-03-29 10:10:39 -07:00
|
|
|
|
// if the next plane (the one above the bed) is a bottom, we have a part on the bed and will not generate support
|
2019-04-22 13:25:52 -07:00
|
|
|
|
if (nextPlaneIsBottom && planes[1].Z <= minimumSupportHeight)
|
2019-03-29 10:10:39 -07:00
|
|
|
|
{
|
|
|
|
|
|
// go up to the next top
|
2019-04-22 13:25:52 -07:00
|
|
|
|
i = planes.GetNextTop(i, minimumSupportHeight);
|
2019-04-10 17:01:21 -07:00
|
|
|
|
if (i >= 0)
|
|
|
|
|
|
{
|
2019-04-22 13:25:52 -07:00
|
|
|
|
lastTopZ = planes[i].Z;
|
2019-04-10 17:01:21 -07:00
|
|
|
|
}
|
2019-03-29 10:10:39 -07:00
|
|
|
|
}
|
|
|
|
|
|
|
2019-04-10 17:01:21 -07:00
|
|
|
|
while (i != -1
|
|
|
|
|
|
&& i != lastBottom
|
|
|
|
|
|
&& i < planes.Count)
|
2019-01-23 14:23:27 -08:00
|
|
|
|
{
|
|
|
|
|
|
lastBottom = i;
|
2019-03-29 15:23:53 -07:00
|
|
|
|
// find all open areas in the list and add support
|
2019-04-22 13:25:52 -07:00
|
|
|
|
i = planes.GetNextBottom(i, minimumSupportHeight);
|
2019-03-29 10:10:39 -07:00
|
|
|
|
if (i >= 0)
|
2019-01-23 14:23:27 -08:00
|
|
|
|
{
|
2019-03-29 10:10:39 -07:00
|
|
|
|
if (i < planes.Count
|
2019-04-22 13:25:52 -07:00
|
|
|
|
&& planes[i].Bottom)
|
2019-03-29 10:10:39 -07:00
|
|
|
|
{
|
2019-04-22 13:25:52 -07:00
|
|
|
|
AddSupportColumn(supportColumnsToAdd, xPos, yPos, lastTopZ, planes[i].Z);
|
2019-03-29 10:10:39 -07:00
|
|
|
|
}
|
2019-04-22 13:25:52 -07:00
|
|
|
|
|
|
|
|
|
|
i = planes.GetNextTop(i + 1, minimumSupportHeight);
|
2019-04-10 17:01:21 -07:00
|
|
|
|
if (i >= 0
|
|
|
|
|
|
&& i < planes.Count)
|
2019-03-29 10:10:39 -07:00
|
|
|
|
{
|
2019-04-22 13:25:52 -07:00
|
|
|
|
lastTopZ = planes[i].Z;
|
2019-03-29 10:10:39 -07:00
|
|
|
|
}
|
2019-01-23 14:23:27 -08:00
|
|
|
|
}
|
2019-04-10 17:01:21 -07:00
|
|
|
|
}
|
2019-01-23 14:23:27 -08:00
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2019-01-30 22:58:12 -08:00
|
|
|
|
scene.UndoBuffer.AddAndDo(new InsertCommand(scene, supportColumnsToAdd.Children, false));
|
2019-01-23 14:23:27 -08:00
|
|
|
|
}
|
|
|
|
|
|
|
2019-04-22 13:25:52 -07:00
|
|
|
|
public struct HitPlane
|
|
|
|
|
|
{
|
|
|
|
|
|
public double Z;
|
|
|
|
|
|
public bool Bottom;
|
|
|
|
|
|
|
|
|
|
|
|
public HitPlane(double z, bool bottom)
|
|
|
|
|
|
{
|
|
|
|
|
|
this.Z = z;
|
|
|
|
|
|
this.Bottom = bottom;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
public class HitPlanes : List<HitPlane>
|
|
|
|
|
|
{
|
|
|
|
|
|
public int GetNextBottom(int i, double skipDist)
|
|
|
|
|
|
{
|
|
|
|
|
|
HitPlanes planes = this;
|
|
|
|
|
|
|
|
|
|
|
|
while (i < planes.Count)
|
|
|
|
|
|
{
|
|
|
|
|
|
// if we are on a bottom
|
|
|
|
|
|
if (planes[i].Bottom)
|
|
|
|
|
|
{
|
|
|
|
|
|
// move up to the next plane and re-evaluate
|
|
|
|
|
|
i++;
|
|
|
|
|
|
}
|
|
|
|
|
|
else // we are on a top
|
|
|
|
|
|
{
|
|
|
|
|
|
// if the next plane is a bottom and more than skipDistanc away
|
|
|
|
|
|
if (i + 1 < planes.Count
|
|
|
|
|
|
&& planes[i + 1].Bottom
|
|
|
|
|
|
&& planes[i + 1].Z > planes[i].Z + skipDist)
|
|
|
|
|
|
{
|
|
|
|
|
|
// this is the next bottom we are looking for
|
|
|
|
|
|
return i + 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
else // move up to the next plane and re-evaluate
|
|
|
|
|
|
{
|
|
|
|
|
|
i++;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
public int GetNextTop(int i, double skipDist)
|
|
|
|
|
|
{
|
|
|
|
|
|
HitPlanes planes = this;
|
|
|
|
|
|
|
|
|
|
|
|
if (!planes[i].Bottom)
|
|
|
|
|
|
{
|
|
|
|
|
|
// skip the one we are
|
|
|
|
|
|
i++;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
while (i < planes.Count)
|
|
|
|
|
|
{
|
|
|
|
|
|
// if we are on a bottom
|
|
|
|
|
|
if (planes[i].Bottom)
|
|
|
|
|
|
{
|
|
|
|
|
|
// move up to the next plane and re-evaluate
|
|
|
|
|
|
i++;
|
|
|
|
|
|
}
|
|
|
|
|
|
else // we are on a top
|
|
|
|
|
|
{
|
|
|
|
|
|
// if the next plane is a bottom and more than skipDistanc away
|
|
|
|
|
|
if (i + 1 < planes.Count
|
|
|
|
|
|
&& planes[i + 1].Bottom
|
|
|
|
|
|
&& planes[i + 1].Z > planes[i].Z + skipDist)
|
|
|
|
|
|
{
|
|
|
|
|
|
// this is the next top we are looking for
|
|
|
|
|
|
return i;
|
|
|
|
|
|
}
|
|
|
|
|
|
else // move up to the next plane and re-evaluate
|
|
|
|
|
|
{
|
|
|
|
|
|
i++;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
private Dictionary<(int x, int y), HitPlanes> DetectRequiredSupportByTracing(RectangleDouble gridBounds, IEnumerable<IObject3D> supportCandidates)
|
2019-01-23 14:23:27 -08:00
|
|
|
|
{
|
2019-03-29 15:23:53 -07:00
|
|
|
|
var allBounds = supportCandidates.GetAxisAlignedBoundingBox();
|
|
|
|
|
|
var rayStartZ = allBounds.MinXYZ.Z - 1;
|
|
|
|
|
|
|
2019-01-23 14:23:27 -08:00
|
|
|
|
var traceData = GetTraceData(supportCandidates);
|
2019-01-22 11:35:47 -08:00
|
|
|
|
|
2019-01-23 12:00:38 -08:00
|
|
|
|
// keep a list of all the detected planes in each support column
|
2019-04-22 13:25:52 -07:00
|
|
|
|
var detectedPlanes = new Dictionary<(int x, int y), HitPlanes>();
|
2019-01-22 11:35:47 -08:00
|
|
|
|
|
2019-01-23 14:23:27 -08:00
|
|
|
|
int gridWidth = (int)gridBounds.Width;
|
|
|
|
|
|
int gridHeight = (int)gridBounds.Height;
|
|
|
|
|
|
|
2019-01-23 12:00:38 -08:00
|
|
|
|
// at the center of every grid item add in a list of all the top faces to look down from
|
|
|
|
|
|
for (int y = 0; y < gridHeight; y++)
|
|
|
|
|
|
{
|
|
|
|
|
|
for (int x = 0; x < gridWidth; x++)
|
2019-01-22 11:35:47 -08:00
|
|
|
|
{
|
2019-03-28 16:04:17 -07:00
|
|
|
|
// add a single plane at the bed so we always know the bed is a top
|
2019-04-22 13:25:52 -07:00
|
|
|
|
detectedPlanes.Add((x, y), new HitPlanes());
|
|
|
|
|
|
detectedPlanes[(x, y)].Add(new HitPlane(0, false));
|
2019-01-23 12:00:38 -08:00
|
|
|
|
for (double yOffset = -1; yOffset <= 1; yOffset++)
|
2019-01-22 11:35:47 -08:00
|
|
|
|
{
|
2019-01-23 12:00:38 -08:00
|
|
|
|
for (double xOffset = -1; xOffset <= 1; xOffset++)
|
2019-01-22 11:35:47 -08:00
|
|
|
|
{
|
2019-01-23 16:08:27 -08:00
|
|
|
|
var halfPillar = PillarSize / 2;
|
|
|
|
|
|
var yPos = (gridBounds.Bottom + y) * PillarSize + halfPillar + (yOffset * halfPillar);
|
|
|
|
|
|
var xPos = (gridBounds.Left + x) * PillarSize + halfPillar + (xOffset * halfPillar);
|
2019-01-23 12:00:38 -08:00
|
|
|
|
|
2019-01-31 07:56:36 -08:00
|
|
|
|
// detect all the bottom plans (surfaces that might need support
|
2019-03-29 15:23:53 -07:00
|
|
|
|
var upRay = new Ray(new Vector3(xPos + .000013, yPos - .00027, rayStartZ), Vector3.UnitZ, intersectionType: IntersectionType.FrontFace);
|
2019-04-22 13:25:52 -07:00
|
|
|
|
IntersectInfo upHit;
|
2019-01-31 07:56:36 -08:00
|
|
|
|
do
|
|
|
|
|
|
{
|
|
|
|
|
|
upHit = traceData.GetClosestIntersection(upRay);
|
|
|
|
|
|
if (upHit != null)
|
|
|
|
|
|
{
|
2019-04-22 13:25:52 -07:00
|
|
|
|
detectedPlanes[(x, y)].Add(new HitPlane(upHit.HitPosition.Z, true));
|
2019-01-31 07:56:36 -08:00
|
|
|
|
|
|
|
|
|
|
// make a new ray just past the last hit to keep looking for up hits
|
|
|
|
|
|
upRay = new Ray(new Vector3(xPos, yPos, upHit.HitPosition.Z + .001), Vector3.UnitZ, intersectionType: IntersectionType.FrontFace);
|
|
|
|
|
|
}
|
2019-04-22 13:25:52 -07:00
|
|
|
|
}
|
|
|
|
|
|
while (upHit != null);
|
2019-01-31 07:56:36 -08:00
|
|
|
|
|
|
|
|
|
|
// detect all the up plans (surfaces that will have support on top of them)
|
2019-03-29 15:23:53 -07:00
|
|
|
|
upRay = new Ray(new Vector3(xPos + .000013, yPos - .00027, rayStartZ), Vector3.UnitZ, intersectionType: IntersectionType.BackFace);
|
2019-01-23 12:00:38 -08:00
|
|
|
|
do
|
2019-01-22 11:35:47 -08:00
|
|
|
|
{
|
2019-01-23 12:00:38 -08:00
|
|
|
|
upHit = traceData.GetClosestIntersection(upRay);
|
|
|
|
|
|
if (upHit != null)
|
2019-01-22 11:35:47 -08:00
|
|
|
|
{
|
2019-04-22 13:25:52 -07:00
|
|
|
|
detectedPlanes[(x, y)].Add(new HitPlane(upHit.HitPosition.Z, false));
|
2019-01-23 12:00:38 -08:00
|
|
|
|
|
|
|
|
|
|
// make a new ray just past the last hit to keep looking for up hits
|
2019-01-31 07:56:36 -08:00
|
|
|
|
upRay = new Ray(new Vector3(xPos, yPos, upHit.HitPosition.Z + .001), Vector3.UnitZ, intersectionType: IntersectionType.BackFace);
|
2019-01-23 12:00:38 -08:00
|
|
|
|
}
|
2019-04-22 13:25:52 -07:00
|
|
|
|
}
|
|
|
|
|
|
while (upHit != null);
|
2019-01-23 12:00:38 -08:00
|
|
|
|
}
|
2019-01-22 11:35:47 -08:00
|
|
|
|
}
|
|
|
|
|
|
}
|
2019-01-23 12:00:38 -08:00
|
|
|
|
}
|
2019-01-22 11:35:47 -08:00
|
|
|
|
|
2019-01-23 14:23:27 -08:00
|
|
|
|
return detectedPlanes;
|
2019-01-22 11:35:47 -08:00
|
|
|
|
}
|
|
|
|
|
|
|
2019-01-23 12:00:38 -08:00
|
|
|
|
private IPrimitive GetTraceData(IEnumerable<IObject3D> supportCandidates)
|
|
|
|
|
|
{
|
|
|
|
|
|
List<Vector3Float> supportVerts;
|
|
|
|
|
|
FaceList supportFaces;
|
|
|
|
|
|
|
|
|
|
|
|
// find all the faces that are candidates for support
|
|
|
|
|
|
supportVerts = new List<Vector3Float>();
|
|
|
|
|
|
supportFaces = new FaceList();
|
2019-03-28 16:04:17 -07:00
|
|
|
|
|
2019-03-29 15:23:53 -07:00
|
|
|
|
// find all the down faces from the support candidates
|
2019-04-15 13:40:31 -07:00
|
|
|
|
AddSupportFaces(supportCandidates,
|
|
|
|
|
|
supportVerts,
|
|
|
|
|
|
supportFaces,
|
2019-03-28 16:04:17 -07:00
|
|
|
|
(angle) => angle <= MaxOverHangAngle);
|
|
|
|
|
|
|
|
|
|
|
|
// find all the up faces from everything on the bed
|
2019-04-15 13:40:31 -07:00
|
|
|
|
AddSupportFaces(scene.Children.SelectMany(i => i.VisibleMeshes()),
|
|
|
|
|
|
supportVerts,
|
2019-03-28 16:04:17 -07:00
|
|
|
|
supportFaces,
|
|
|
|
|
|
(angle) => angle >= 90);
|
|
|
|
|
|
|
|
|
|
|
|
return supportFaces.CreateTraceData(supportVerts);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
private void AddSupportFaces(IEnumerable<IObject3D> supportCandidates, List<Vector3Float> supportVerts, FaceList supportFaces, Func<double, bool> doAdd)
|
|
|
|
|
|
{
|
2019-01-23 12:00:38 -08:00
|
|
|
|
foreach (var item in supportCandidates)
|
|
|
|
|
|
{
|
|
|
|
|
|
// add all the down faces to supportNeededImage
|
|
|
|
|
|
var matrix = item.WorldMatrix(scene);
|
|
|
|
|
|
for (int faceIndex = 0; faceIndex < item.Mesh.Faces.Count; faceIndex++)
|
|
|
|
|
|
{
|
|
|
|
|
|
var face0Normal = item.Mesh.Faces[faceIndex].normal.TransformNormal(matrix).GetNormal();
|
|
|
|
|
|
var angle = MathHelper.RadiansToDegrees(Math.Acos(face0Normal.Dot(-Vector3Float.UnitZ)));
|
|
|
|
|
|
|
2019-03-28 16:04:17 -07:00
|
|
|
|
if (doAdd(angle))
|
2019-01-23 12:00:38 -08:00
|
|
|
|
{
|
|
|
|
|
|
var face = item.Mesh.Faces[faceIndex];
|
|
|
|
|
|
var verts = new int[] { face.v0, face.v1, face.v2 };
|
|
|
|
|
|
var p0 = item.Mesh.Vertices[face.v0].Transform(matrix);
|
|
|
|
|
|
var p1 = item.Mesh.Vertices[face.v1].Transform(matrix);
|
|
|
|
|
|
var p2 = item.Mesh.Vertices[face.v2].Transform(matrix);
|
|
|
|
|
|
var vc = supportVerts.Count;
|
|
|
|
|
|
supportVerts.Add(p0);
|
|
|
|
|
|
supportVerts.Add(p1);
|
|
|
|
|
|
supportVerts.Add(p2);
|
|
|
|
|
|
|
|
|
|
|
|
supportFaces.Add(vc, vc + 1, vc + 2, face0Normal);
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
2019-01-22 11:35:47 -08:00
|
|
|
|
}
|
|
|
|
|
|
}
|