miconvexhull Discussions Rss Feedhttp://miconvexhull.codeplex.com/Thread/List.aspxmiconvexhull Discussions Rss DescriptionNew Post: MIConvexHull has moved to GitHubhttps://miconvexhull.codeplex.com/discussions/657372<div style="line-height: normal;">Moved to GitHub
<br />
Please change bookmarks to: <a href="https://designengrlab.github.io/MIConvexHull/" rel="nofollow">https://designengrlab.github.io/MIConvexHull/</a>
<br />
The new repository is: <a href="https://github.com/DesignEngrLab/MIConvexHull.git" rel="nofollow">https://github.com/DesignEngrLab/MIConvexHull.git</a><br />
</div>matticaTue, 23 Aug 2016 14:32:28 GMTNew Post: MIConvexHull has moved to GitHub 20160823023228PNew Post: 3D Convex Hull WPF example issuehttps://miconvexhull.codeplex.com/discussions/656787<div style="line-height: normal;">This should now be fixed.<br />
</div>daveczSat, 06 Aug 2016 16:18:03 GMTNew Post: 3D Convex Hull WPF example issue 20160806041803PNew Post: Library modification for integration with DirectXhttps://miconvexhull.codeplex.com/discussions/656768<div style="line-height: normal;">Hi,<br />
<br />
if you read the licence, it tells you can do that.<br />
<br />
Edit: Tho a small warning -- changing the internal computations to float will likely break it for some input cases where the "double" works.<br />
<br />
David<br />
</div>daveczSat, 06 Aug 2016 16:16:25 GMTNew Post: Library modification for integration with DirectX 20160806041625PNew Post: 3D Convex Hull WPF example issuehttp://miconvexhull.codeplex.com/discussions/656787<div style="line-height: normal;">in Convex Hull 3D Example if you choose variant "Make regular Grid" and then analyze, it will return only 4 points instead of full set. In random uniform and sphere variants convex calculation is working correctly.<br />
</div>Balck_JokerFri, 29 Jul 2016 06:41:19 GMTNew Post: 3D Convex Hull WPF example issue 20160729064119ANew Post: Library modification for integration with DirectXhttps://miconvexhull.codeplex.com/discussions/656768<div style="line-height: normal;">Hi,
<br />
I want to ask permission to modify your library for my own project and change using of double to float type to get rid of casting each vertex and normal to "native" Direct3D type (float) and also speedup calculations a little.
<br />
<br />
Can I do this from license point of view?<br />
</div>Balck_JokerThu, 28 Jul 2016 13:51:15 GMTNew Post: Library modification for integration with DirectX 20160728015115PNew Post: triangulationhttps://miconvexhull.codeplex.com/discussions/656618<div style="line-height: normal;">Hi,
<br />
<br />
the 7DelaunayWPF (RandomTriagulation.cs) and 6UsingHelixStudio examples show how to use consume the triangulation data.
<br />
<br />
As to what you get, just check the source code of the DefaultTriangulationCell class (and the classes it is derived from).<br />
</div>daveczFri, 22 Jul 2016 15:26:14 GMTNew Post: triangulation 20160722032614PNew Post: triangulationhttp://miconvexhull.codeplex.com/discussions/656618<div style="line-height: normal;">Hi, there is no documentation for this so I have a couple of questions.
<br />
Is the following correct usage:
<br />
var tetrahedrons = Triangulation.CreateDelaunay<Vertex, DefaultTriangulationCell<Vertex>>(vVertices, config).Cells;
<br />
If so what data does it provide me exactly, I get Vertex's with 1's or 0's nothing else.<br />
</div>aaronhanceFri, 22 Jul 2016 00:36:31 GMTNew Post: triangulation 20160722123631ANew Post: Get voronoi cells?https://miconvexhull.codeplex.com/discussions/287342<div style="line-height: normal;">I did some extensions based on the MIConvexHull library that include the ability to retrieve polygons from the mesh points
<br />
with arbitrary boundary points. ( actually it works only for 2D )
<br />
There is an example here <a href="https://github.com/devel0/SearchAThing.Sci.Examples#mesh2d-voronoi-convex-hull" rel="nofollow">https://github.com/devel0/SearchAThing.Sci.Examples#mesh2d-voronoi-convex-hull</a>
<br />
<br />
Would nice if the MIConvexHull project here on CodePlex can migrated to Git version, I know this is possible from SVN simply asking at codeplex maintainers but may that feature is available from Mercurial to Git too.<br />
</div>ldelanaSun, 12 Jun 2016 14:49:37 GMTNew Post: Get voronoi cells? 20160612024937PNew Post: Gradient Color for whole modelhttps://miconvexhull.codeplex.com/discussions/650550<div style="line-height: normal;">Thanks a lot David.Your previous reply worked.I calculated convex hull points of polygon and then applied gradient brush through texture co-ordinates.
<br />
<br />
Thanks Again,
<br />
<br />
Bhupesh<br />
</div>tonyyy39Fri, 05 Feb 2016 09:48:42 GMTNew Post: Gradient Color for whole model 20160205094842ANew Post: Gradient Color for whole modelhttps://miconvexhull.codeplex.com/discussions/650550<div style="line-height: normal;">This seems useful <a href="http://stackoverflow.com/questions/3881576/wpf-3d-mapping-gradient-brush-on-complex-geometry" rel="nofollow">http://stackoverflow.com/questions/3881576/wpf-3d-mapping-gradient-brush-on-complex-geometry</a><br />
</div>daveczWed, 03 Feb 2016 14:30:11 GMTNew Post: Gradient Color for whole model 20160203023011PNew Post: Gradient Color for whole modelhttps://miconvexhull.codeplex.com/discussions/650550<div style="line-height: normal;">HI David,
<br />
<br />
Thanks again for replying.
<br />
I just want help for this line-
<br />
<br />
Then you apply the gradient brush to the hull model which you will only make visible when the geometry is collapsed.
<br />
<br />
Could you please give an example how to apply gradient brush to the hull model.<br />
</div>tonyyy39Sat, 30 Jan 2016 15:31:21 GMTNew Post: Gradient Color for whole model 20160130033121PNew Post: Gradient Color for whole modelhttps://miconvexhull.codeplex.com/discussions/650550<div style="line-height: normal;">Well I guess you just want to color the convex hull then. In that case, use the library to compute the convex hull of your points (or you can extract the triangles from the Delaunay triangulation -- these are the triangles that have no neighbors -- it's you leave out the vertex in a tetrahedron whose adjacency is set to null and you get the triangle). Then you apply the gradient brush to the hull model which you will only make visible when the geometry is collapsed.
<br />
<br />
David<br />
</div>daveczFri, 29 Jan 2016 09:39:37 GMTNew Post: Gradient Color for whole model 20160129093937ANew Post: Gradient Color for whole modelhttps://miconvexhull.codeplex.com/discussions/650550<div style="line-height: normal;">Hi DavecZ,
<br />
<br />
Thanks for replying.I have also tried this solution earlier.
<br />
But problem is,in this project each tetrahedrons are colored and combined.
<br />
So my question was-is there a way to color whole model3dgroup(combination of tetrahedrons).
<br />
<br />
What I mean is-
<br />
I want to keep color white for each tetarhedrons.After combining all tetrahedrons I want give a color to whole set of model3dgroup.
<br />
<br />
<br />
Thanks & Regards,
<br />
Bhupesh<br />
</div>tonyyy39Thu, 28 Jan 2016 14:17:19 GMTNew Post: Gradient Color for whole model 20160128021719PNew Post: Gradient Color for whole modelhttps://miconvexhull.codeplex.com/discussions/650550<div style="line-height: normal;">Hi Bhupesh,
<br />
<br />
to my knowledge WPF 3D can't do "vertex colors" the way OpenGL or D3D can. As far as I know there are two options using WPF 3D:<br />
<ol>
<li>Generate a gradient texture that you will map to the geometry.</li>
<li>
Use a gradient brush -- something like <a href="http://stackoverflow.com/questions/10296582/absolute-scaling-a-lineargradientbrush-texture-in-wpf-3d" rel="nofollow">http://stackoverflow.com/questions/10296582/absolute-scaling-a-lineargradientbrush-texture-in-wpf-3d</a> should work.<br />
</li>
</ol>
Alternatively, you can use OpenGL in .NET as well where you can just assign vertex colors to each vertex and OpenGL will interpolate the colors for you. Or just write a simple vertex shader (which does not seem to be possible in WPF3D either).
<br />
<br />
David<br />
</div>daveczThu, 28 Jan 2016 11:50:28 GMTNew Post: Gradient Color for whole model 20160128115028ANew Post: Gradient Color for whole modelhttps://miconvexhull.codeplex.com/discussions/650550<div style="line-height: normal;">HI ,
<br />
<br />
This is very nice project.I am currently using 7delaunayWPF project.
<br />
Have a question here.
<br />
How to give gradient color to whole polygon.Instead of giving color to each tetrahedron.
<br />
I want to give gradient color(mixture of 2 or 3 colors) to whole polygon(model3dgroup).
<br />
I tried a lot to calculate points.But didnot worked.I want similar like this-
<br />
<br />
<a href="https://www.google.co.in/imgres?imgurl=http://www.openprocessing.org/sketch/thumbnail/180760/cache/2015-01-13%25252006:50:46&imgrefurl=http://www.openprocessing.org/collection/2234&h=100&w=100&tbnid=gBViK7XshqnQeM:&docid=68Yc1S_PCLnRZM&ei=FcGoVqfeHsS3uQSptb-gBw&tbm=isch&ved=0ahUKEwjnvOnhh8rKAhXEW44KHanaD3QQMwhIKCIwIg" rel="nofollow">https://www.google.co.in/imgres?imgurl=http://www.openprocessing.org/sketch/thumbnail/180760/cache/2015-01-13%25252006:50:46&imgrefurl=http://www.openprocessing.org/collection/2234&h=100&w=100&tbnid=gBViK7XshqnQeM:&docid=68Yc1S_PCLnRZM&ei=FcGoVqfeHsS3uQSptb-gBw&tbm=isch&ved=0ahUKEwjnvOnhh8rKAhXEW44KHanaD3QQMwhIKCIwIg</a>
<br />
<br />
Thanks & Regards,
<br />
Bhupesh<br />
</div>tonyyy39Wed, 27 Jan 2016 13:20:34 GMTNew Post: Gradient Color for whole model 20160127012034PNew Post: Test whether Point is contained within ConvexHullhttp://miconvexhull.codeplex.com/discussions/649878<div style="line-height: normal;">If you want to use the output of the program to determine the point's position you have to write this yourself.
<br />
<br />
One way to do this:<br />
<ul>
<li>Each ConvexFace defines a normal N. This can be used to determine the plane the face defines. For 3D: N[0]x + N[1]y + N[2]z + D = 0 where D = - N . P and P is an arbitrary point of the corresponding face and '.' is the dot product.</li>
<li>Now you can compute the value of N . A + D (where A is your point) for each face of the hull. Positive value means the point is "above" the plane and negative "bellow" the plane. </li>
<li>If the point is bellow all the face-planes, it is inside the hull. In other words, if you encounter a face for which the point is "above", the point is outside the hull.</li>
</ul>
</div>daveczMon, 11 Jan 2016 23:41:38 GMTNew Post: Test whether Point is contained within ConvexHull 20160111114138PNew Post: Test whether Point is contained within ConvexHullhttps://miconvexhull.codeplex.com/discussions/649878<div style="line-height: normal;">Is there a way to test whether a point is contained within a ConvexHull? I glanced over the source code, but could not find it.<br />
</div>zkhanMon, 11 Jan 2016 19:11:01 GMTNew Post: Test whether Point is contained within ConvexHull 20160111071101PNew Post: ConvexHull seems to need ordered vertices.https://miconvexhull.codeplex.com/discussions/646638<div style="line-height: normal;">Thanks for the explanation.
<br />
Have a nice day.
<br />
<br />
Best Regards,
<br />
Melissa<br />
</div>MelissaAThu, 05 Nov 2015 11:52:04 GMTNew Post: ConvexHull seems to need ordered vertices. 20151105115204ANew Post: ConvexHull seems to need ordered vertices.https://miconvexhull.codeplex.com/discussions/646638<div style="line-height: normal;">The algorithm is the same for all dimensions (the original version had a specialized algorithm for 2D hulls but that has been replaced). Each time there are co-linear vertices (or also vertices that lie on a sphere in case of triangulation -- because in that case the triangulation might not be unique) it gets a bit tricky. The safest bet seems to be to use the small perturbations which should solve the problem in most cases.
<br />
<br />
You can also try to write some post processing routines of your own. For example, remove a vertex from the hull if it lies on a plane (line/plane/hyperplane) defined by its neighbor vertices. This is very straightforward in 2D, but can get a bit tricky in higher dimensions.
<br />
<br />
(There is also the possibility that I'm simply ignorant of some elegant method to solve this problem that would also work in the general n-dimensional case and as such would be a good fit to include in the library)<br />
</div>daveczWed, 04 Nov 2015 18:39:26 GMTNew Post: ConvexHull seems to need ordered vertices. 20151104063926PNew Post: ConvexHull seems to need ordered vertices.https://miconvexhull.codeplex.com/discussions/646638<div style="line-height: normal;">Hi David,
<br />
<br />
Maybe there is the same problem in 2D with the algorithm?
<br />
I explain myself better: if I have a list of 2D point along a Rectangle (so there are collinear outer points), can the algorithm have the same problem?
<br />
<br />
Thanks,
<br />
Melissa<br />
</div>MelissaAMon, 02 Nov 2015 08:06:41 GMTNew Post: ConvexHull seems to need ordered vertices. 20151102080641A