question-mark
Stuck on an issue?

Lightrun Answers was designed to reduce the constant googling that comes with debugging 3rd party libraries. It collects links to all the places you might be looking at while hunting down a tough bug.

And, if you’re still stuck at the end, we’re happy to hop on a call to see how we can help out.

Delaunay triangulation from voronoi tessellation

See original GitHub issue

Hello @marcomusy, I would like to know how Delaunay triangulation can be applied to find the connectivity of the cells formed by voronoi tessellation in vedo.

The following is the code that I’m using to generate voronoi cells using the scipy library. I’d like to do this in vedo but I am not sure how to do it.

    import numpy as np
    from scipy.spatial import Voronoi, voronoi_plot_2d
    import shapely.geometry
    import shapely.ops
    
    points = np.random.random((20, 2))
    vor = Voronoi(points)
    fig = voronoi_plot_2d(vor)
    plt.show()

I would like to know if voronoi tessellation can be generated in vedo and find the cell connectivity by applying Delaunay triangulation. Here, I am actually looking at applying this to biological cells to find how the biological cells are connected with each other.

Thanks a lot

Issue Analytics

  • State:closed
  • Created 2 years ago
  • Comments:22 (11 by maintainers)

github_iconTop GitHub Comments

2reactions
marcomusycommented, Oct 3, 2021

Not an expert… I guess you can overlay the DT with delaunay2D, which is the “dual” of voronoi, and then use examples/basic/connVtx.py to link the voronoi cells. You maybe still left with the problem that triangulation is a bit arbitrary, so you may end up with different connectivity matrices for very similar point configurations.

1reaction
marcomusycommented, Jan 14, 2022

simply replace .wireframe(False)

Screenshot 2022-01-14 at 01 14 58
Read more comments on GitHub >

github_iconTop Results From Across the Web

Delaunay Triangulation and Voronoi Diagram
The Voronoi diagram (also Thiessen polygons or Dirichlet tessellation) is known as the so-called dual graph of the Delaunay triangulation.
Read more >
Voronoi Diagrams and Delaunay Triangulations - JHU CS
The Delaunay triangulation is the straight-line dual of the Voronoi Diagram. Note: The Delaunay edges don't have to cross their Voronoi duals.
Read more >
[Tutorial] Voronoi Diagram and Delaunay Triangulation in O(n ...
The Delaunay triangulation only involves edges between existing points, while the Voronoi diagram creates new vertices and needs a way to ...
Read more >
Delaunay triangulation - Wikipedia
Relationship with the Voronoi diagramEdit · Three or more collinear points, where the circumcircles are of infinite radii. · Four or more points...
Read more >
Delaunay Triangulation and Voronoi Diagrams
Consider this post an initiation into Delaunay triangulations and related concepts like Voronoi tessellations, as well as the many methods ...
Read more >

github_iconTop Related Medium Post

No results found

github_iconTop Related StackOverflow Question

No results found

github_iconTroubleshoot Live Code

Lightrun enables developers to add logs, metrics and snapshots to live code - no restarts or redeploys required.
Start Free

github_iconTop Related Reddit Thread

No results found

github_iconTop Related Hackernoon Post

No results found

github_iconTop Related Tweet

No results found

github_iconTop Related Dev.to Post

No results found

github_iconTop Related Hashnode Post

No results found