possible to find voronoi neighbors similar to d3-delanauy? 

Hi, is there a way to use this python implementation to voronoi neighbors that exclude pairs that do not have a common edge, akin to this solution https://observablehq.com/@d3/voronoi-neighbors from d3-delanauy in javascript? 