| Article | 70002578 |
| Type | Wish |
| Product | Engine |
| Version | 1102 |
| Date Added | 10/21/2024 12:00:00 AM |
| Fixed | 11.3.1.0 (10/22/2024 12:00:00 AM) |
| Submitted by | Schell Thomas |
Summary
Improve Delaunay triangulation performance and a new method to calculate the outline boundaries of a points collection
Solution
The performance of the exported Triangulate algorithms improved in version 11.3.1
Following methods performance was improved:
VectorDraw.Geometry.Delaunay.Triangulate
VectorDraw.Geometry.Delaunay.TriangulateToFaceList
VectorDraw.Geometry.Delaunay.aShapeConvexHull
vdPolyface.Triangulate
vdGroundSurface.Triangles
gPoints.GetOutlineBoundaryaShape
Νοτε that the improvement is significant
An example of 261000 points takes 150 ms instead of 900000 sec (15 min) of previous version