A huge thank you to Zeljko Gjuranic for providing this code for a guest post. The code is based on a paper of Zeljko’s that was published in issue 11 of KoG magazine. The original paper is available in Croatian with an abstract in English.
The code in this post asks the user to select a set of points and then creates a polyface mesh by using Delaunay triangulation on those points.
[As we’re creating a polyface mesh we’re limited to 32,767 vertices. This is a known limitation when using the PolyFaceMesh object: with the new SubDMesh object in AutoCAD 2010 it should be possible to write a version that doesn’t suffer from this limitation. Something to look forward to from a future post…]
Here’s Zeljko’s C# code, re-formatted very slightly for posting:
using Autodesk.AutoCAD.ApplicationServices;
using Autodesk.AutoCAD.DatabaseServices;
using Autodesk.AutoCAD.Runtime;
using Autodesk.AutoCAD.EditorInput;
using Autodesk.AutoCAD.Geometry;
using System;
public class Triangulate
{
public bool circum(
double x1, double y1, double x2,
double y2, double x3, double y3,
ref double xc, ref double yc, ref double r)
{
// Calculation of circumscribed circle coordinates and
// squared radius
const double eps = 1e-6;
const double big = 1e12;
bool result = true;
double m1, m2, mx1, mx2, my1, my2, dx, dy;
if ((Math.Abs(y1 - y2) < eps) && (Math.Abs(y2 - y3) < eps))
{
result = false;
xc = x1; yc = y1; r = big;
}
else
{
if (Math.Abs(y2 - y1) < eps)
{
m2 = -(x3 - x2) / (y3 - y2);
mx2 = (x2 + x3) / 2;
my2 = (y2 + y3) / 2;
xc = (x2 + x1) / 2;
yc = m2 * (xc - mx2) + my2;
}
else if (Math.Abs(y3 - y2) < eps)
{
m1 = -(x2 - x1) / (y2 - y1);
mx1 = (x1 + x2) / 2;
my1 = (y1 + y2) / 2;
xc = (x3 + x2) / 2;
yc = m1 * (xc - mx1) + my1;
}
else
{
m1 = -(x2 - x1) / (y2 - y1);
m2 = -(x3 - x2) / (y3 - y2);
if (Math.Abs(m1 - m2) < eps)
{
result = false;
xc = x1;
yc = y1;
r = big;
}
else
{
mx1 = (x1 + x2) / 2;
mx2 = (x2 + x3) / 2;
my1 = (y1 + y2) / 2;
my2 = (y2 + y3) / 2;
xc = (m1 * mx1 - m2 * mx2 + my2 - my1) / (m1 - m2);
yc = m1 * (xc - mx1) + my1;
}
}
}
dx = x2 - xc;
dy = y2 - yc;
r = dx * dx + dy * dy;
return result;
}
[CommandMethod("TRIANG")]
public void TriangulateCommand()
{
const int maxpoints = 32767;
Document doc =
Application.DocumentManager.MdiActiveDocument;
Database db = doc.Database;
Editor ed = doc.Editor;
TypedValue[] tvs = { new TypedValue(0, "POINT") };
SelectionFilter sf =
new SelectionFilter(tvs);
PromptSelectionOptions pso = new PromptSelectionOptions();
pso.MessageForAdding = "Select Points:";
pso.AllowDuplicates = false;
PromptSelectionResult psr = ed.GetSelection(pso, sf);
if (psr.Status == PromptStatus.Error) return;
if (psr.Status == PromptStatus.Cancel) return;
SelectionSet ss = psr.Value;
int npts = ss.Count;
if (npts < 3)
{
ed.WriteMessage("Minimum 3 points must be selected!");
return;
}
if (npts > maxpoints)
{
ed.WriteMessage("Maximum nuber of points exceeded!");
return;
}
int i, j, k, ntri, ned, status1 = 0, status2 = 0;
bool status;
// Point coordinates
double[] ptx = new double[maxpoints + 3];
double[] pty = new double[maxpoints + 3];
double[] ptz = new double[maxpoints + 3];
// Triangle definitions
int[] pt1 = new int[maxpoints * 2 + 1];
int[] pt2 = new int[maxpoints * 2 + 1];
int[] pt3 = new int[maxpoints * 2 + 1];
// Circumscribed circle
double[] cex = new double[maxpoints * 2 + 1];
double[] cey = new double[maxpoints * 2 + 1];
double[] rad = new double[maxpoints * 2 + 1];
double xmin, ymin, xmax, ymax, dx, dy, xmid, ymid;
int[] ed1 = new int[maxpoints * 2 + 1];
int[] ed2 = new int[maxpoints * 2 + 1];
ObjectId[] idarray = ss.GetObjectIds();
Transaction tr =
db.TransactionManager.StartTransaction();
using (tr)
{
DBPoint ent;
k = 0;
for (i = 0; i < npts; i++)
{
ent =
(DBPoint)tr.GetObject(idarray[k], OpenMode.ForRead, false);
ptx[i] = ent.Position[0];
pty[i] = ent.Position[1];
ptz[i] = ent.Position[2];
for (j = 0; j < i; j++)
if ((ptx[i] == ptx[j]) && (pty[i] == pty[j]))
{
i--; npts--; status2++;
}
k++;
}
tr.Commit();
}
if (status2 > 0)
ed.WriteMessage(
"\nIgnored {0} point(s) with same coordinates.",
status2
);
// Supertriangle
xmin = ptx[0]; xmax = xmin;
ymin = pty[0]; ymax = ymin;
for (i = 0; i < npts; i++)
{
if (ptx[i] < xmin) xmin = ptx[i];
if (ptx[i] > xmax) xmax = ptx[i];
if (pty[i] < xmin) ymin = pty[i];
if (pty[i] > xmin) ymax = pty[i];
}
dx = xmax - xmin; dy = ymax - ymin;
xmid = (xmin + xmax) / 2; ymid = (ymin + ymax) / 2;
i = npts;
ptx[i] = xmid - (90 * (dx + dy)) - 100;
pty[i] = ymid - (50 * (dx + dy)) - 100;
ptz[i] = 0;
pt1[0] = i;
i++;
ptx[i] = xmid + (90 * (dx + dy)) + 100;
pty[i] = ymid - (50 * (dx + dy)) - 100;
ptz[i] = 0;
pt2[0] = i;
i++;
ptx[i] = xmid;
pty[i] = ymid + 100 * (dx + dy + 1);
ptz[i] = 0;
pt3[0] = i;
ntri = 1;
circum(
ptx[pt1[0]], pty[pt1[0]], ptx[pt2[0]],
pty[pt2[0]], ptx[pt3[0]], pty[pt3[0]],
ref cex[0], ref cey[0], ref rad[0]
);
// main loop
for (i = 0; i < npts; i++)
{
ned = 0;
xmin = ptx[i]; ymin = pty[i];
j = 0;
while (j < ntri)
{
dx = cex[j] - xmin; dy = cey[j] - ymin;
if (((dx * dx) + (dy * dy)) < rad[j])
{
ed1[ned] = pt1[j]; ed2[ned] = pt2[j];
ned++;
ed1[ned] = pt2[j]; ed2[ned] = pt3[j];
ned++;
ed1[ned] = pt3[j]; ed2[ned] = pt1[j];
ned++;
ntri--;
pt1[j] = pt1[ntri];
pt2[j] = pt2[ntri];
pt3[j] = pt3[ntri];
cex[j] = cex[ntri];
cey[j] = cey[ntri];
rad[j] = rad[ntri];
j--;
}
j++;
}
for (j = 0; j < ned - 1; j++)
for (k = j + 1; k < ned; k++)
if ((ed1[j] == ed2[k]) && (ed2[j] == ed1[k]))
{
ed1[j] = -1; ed2[j] = -1; ed1[k] = -1; ed2[k] = -1;
}
for (j = 0; j < ned; j++)
if ((ed1[j] >= 0) && (ed2[j] >= 0))
{
pt1[ntri] = ed1[j]; pt2[ntri] = ed2[j]; pt3[ntri] = i;
status =
circum(
ptx[pt1[ntri]], pty[pt1[ntri]], ptx[pt2[ntri]],
pty[pt2[ntri]], ptx[pt3[ntri]], pty[pt3[ntri]],
ref cex[ntri], ref cey[ntri], ref rad[ntri]
);
if (!status)
{
status1++;
}
ntri++;
}
}
// removal of outer triangles
i = 0;
while (i < ntri)
{
if ((pt1[i] >= npts) || (pt2[i] >= npts) || (pt3[i] >= npts))
{
ntri--;
pt1[i] = pt1[ntri];
pt2[i] = pt2[ntri];
pt3[i] = pt3[ntri];
cex[i] = cex[ntri];
cey[i] = cey[ntri];
rad[i] = rad[ntri];
i--;
}
i++;
}
tr = db.TransactionManager.StartTransaction();
using (tr)
{
BlockTable bt =
(BlockTable)tr.GetObject(
db.BlockTableId,
OpenMode.ForRead,
false
);
BlockTableRecord btr =
(BlockTableRecord)tr.GetObject(
bt[BlockTableRecord.ModelSpace],
OpenMode.ForWrite,
false
);
PolyFaceMesh pfm = new PolyFaceMesh();
btr.AppendEntity(pfm);
tr.AddNewlyCreatedDBObject(pfm, true);
for (i = 0; i < npts; i++)
{
PolyFaceMeshVertex vert =
new PolyFaceMeshVertex(
new Point3d(ptx[i], pty[i], ptz[i])
);
pfm.AppendVertex(vert);
tr.AddNewlyCreatedDBObject(vert, true);
}
for (i = 0; i < ntri; i++)
{
FaceRecord face =
new FaceRecord(
(short)(pt1[i] + 1),
(short)(pt2[i] + 1),
(short)(pt3[i] + 1),
0
);
pfm.AppendFaceRecord(face);
tr.AddNewlyCreatedDBObject(face, true);
}
tr.Commit();
}
if (status1 > 0)
ed.WriteMessage(
"\nWarning! {0} thin triangle(s) found!" +
" Wrong result possible!",
status1
);
Application.UpdateScreen();
}
}
To see the command in action, first we create a set of DBPoints (using AutoCAD’s POINT command). I’ve created these points at different elevations, to put the code through its paces in three dimensions:
Running the TRIANG command and selecting these points creates a polyface mesh (here with PDMODE reset to 0):
And here’s a 3D view on this mesh, to see the depth:
Thanks again to Zeljko for providing this excellent sample!
