★ See Example Project @ EdgesAndGraphs/PCGEx_Graph_Delaunay-3D
Related
Table of content
This node creates a 3D Delaunay tetrahedralization from the input points. If you’d like to know more about Delaunay intrinsic properties, check out the Wikipedia article!
It has very very interesting properties, and this node also offers the ability to output the Urquhart alternative; which is even more fascinating.
Properties
Property | Description |
---|---|
Settings | |
Urquhart | If enabled, the node will output the Urquhart version of the Delaunay graph. |
Hull Attribute NameBoolean
| If enabled, will flag output Vtx points that lie on the convex hull of the graph. |
Mark Edge on Touch | If enabled, edges that have at least a point on the Hull as marked as being on the hull; as opposed to only be marked as hull edges if both endpoints are on the hull. |
Sites
Output Sites | If enabled, the node will output the Delaunay Sites. Each site is the centroid of a Delaunay triangle. |
Site Hull Attribute NameBoolean
| If enabled, will flag output site points that have at least an edge that lie on the convex hull of the graph. |
Contrary to the Delaunay 2D node, the 3D version does not offer site-merging. Not only is it not trivial, it’s all also of very little use as its main appeal is to find contours, which works poorly (if at all) on complex 3D topologies.
Projection Settings
Property | Description |
---|---|
Target Distance | Target Distance reference.. Whether to consider point bounds, and if so, how. |
Fuse Method | Lets you choose the method for finding neighbors & collocated points |
Voxel Grid Offset | Offset the voxelized grid by an constant amount. By default the center of the grid is 0,0,0, which may look like an undersirable offset. That offset can be manually compensated using this parameter. |
Inline Insertion |
Using the Octree fuse method is not deterministic by default. Enabling inlined insertion will make it so, at the cost of speed. |
Source Distance | Source Distance reference. Whether to consider point bounds, and if so, how. |
Tolerance | |
Component Wise Tolerance | If enabled, lets you set individual tolerance in world space for each X , Y and Z axis. |
Tolerance | Uniform tolerance. This represent the radius within which elements will be considered in fuse range. |
Tolerances | If enabled, represent individual axis’ radius within which elements will be considered in fuse range. |
Local Tolerance | If enabled, lets your use per-point tolerance value. NOT IMPLEMENTED |
Property | Description |
---|---|
Enable Self Intersection | If enabled, a cluster will test if intersection exists against itself. Otherwise, only check against other clusters. |
Fuse Details | |
Source Distance | Source Distance reference. Whether to consider point bounds, and if so, how. |
Component Wise Tolerance | If enabled, lets you set individual tolerance in world space for each X , Y and Z axis. |
Tolerance | Uniform tolerance. This represent the radius within which elements will be considered in fuse range. |
Tolerances | If enabled, represent individual axis’ radius within which elements will be considered in fuse range. |
Local Tolerance | If enabled, lets your use per-point tolerance value. NOT IMPLEMENTED |
Outputs | |
Snap on Edge | If enabled, snap the intersection position onto the original edge, as opposed to the reverse. |
Intersector Attribute Namebool
| If enabled, flag the points that intersected with an edge. |
The projection settings control how the point position is translated to a 2D space before the graph is computed; and how this projection will translate back to the original space, if relevant.
Property | Description |
---|---|
Projection Normal | Normal vector of the plane used for projection. By default, the projection plan normal is Up ; so the graph is computed over the X Y plane. |
Local Projection Normal | If enabled, uses a per-point projection vector. |
Local Normal | Attribute ti read normal from, |
Local projection normal is very powerful but can also be very clunky to use – it’s very easy to end up with singularities that will prevent the graph from being properly computed.