From 9334203fd14a5d790ea3c10d8c8497a022ebbb62 Mon Sep 17 00:00:00 2001
From: Amit Patel Delaunator guide
The triangulation is represented as compact arrays of integers. It’s less convenient than other representations but is the reason the library is fast.
After constructing a delaunay = Delaunator.from(points)
object, it will have a triangles
array and a halfedges
array, both indexed by half-edge id. What’s a half-edge?
@@ -130,11 +130,11 @@
+
It will also be useful to have some helper functions to go from one half-edge to the next and previous half-edges in the same triangle:
- @@ -207,7 +207,7 @@A Voronoi diagram is built by connecting the Delaunay triangle circumcenters together using the dual of the Delaunay graph. @@ -373,7 +373,7 @@
The Delaunator library uses half-edges to represent the @@ -383,7 +383,7 @@
nextHalfedge
, prevHalfedge
, halfedges[]
nextHalfedge
, prevHalfedge
, halfedges[]
triangles[]
triangleOfEdge
edgesOfTriangle
edgesAroundPoint
+ triangleOfEdge
The code shown on this page is also running on the page, to produce the diagrams. By default the <script>
tags on the page are hidden, but on this page they are made visible with CSS: script { display: block }
.