I am trying to construct a `HalfEdge`

data structure with the vertices data of my `BufferGeometry`

.

Using the implementation in `examples/Quickhull.js`

, I managed to construct an array of `Face`

s that each contain a starting `HalfEdge`

. I can then call `HalfEdge.next()`

and again to find all three `HalfEdge`

that make up a given `Face`

.

The problem is, given a `Face`

, I can find out what `HalfEdge`

s compose that face, but I cannot find any adjacent faces because my `HalfEdge`

s are missing the “twin” data.

How can I traverse through my `HalfEdge`

s and match a “twin” `HalfEdge`

for each?

Here is a fiddle that I made to illustrate my problem.

https://jsfiddle.net/z9v8f7qb/31/