From 9334203fd14a5d790ea3c10d8c8497a022ebbb62 Mon Sep 17 00:00:00 2001 From: Amit Patel Date: Sat, 25 Aug 2018 18:36:05 -0700 Subject: [PATCH] Add section anchors * Major sections will be linkable (but the anchors aren't exposed anywhere) * Also fix typo in anchor "edges-to-edges" should have been "edge-to-edges" --- docs/index.html | 14 +++++++------- 1 file changed, 7 insertions(+), 7 deletions(-) diff --git a/docs/index.html b/docs/index.html index 4e3bb62..2f3b0ca 100644 --- a/docs/index.html +++ b/docs/index.html @@ -91,7 +91,7 @@

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.

-

Delaunay triangles

+

Delaunay triangles

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 @@

Delaunay triangles

function triangleOfEdge(e) { return Math.floor(e/3); } -

+

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 @@

Adjacent triangles

} -

Voronoi cells

+

Voronoi cells

A Voronoi diagram is built by connecting the Delaunay triangle circumcenters together using the dual of the Delaunay graph. @@ -373,7 +373,7 @@

Convex hull

However, even with these changes, constructing the Voronoi cell along the convex hull requires projecting the edges outwards and clipping them. The Delaunator library doesn’t provide this functionality; consider using d3-delaunay if you need it.

-

Summary

+

Summary

The Delaunator library uses half-edges to represent the @@ -383,7 +383,7 @@

Summary

-

About this page

+

About this page

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 }.