Visualizing Delaunay Triangulation
Take a look at this: This is a triangulation of a set of random points, such that all the points are connected to one another, all of the faces are triangles, and the edges include the convex hull of the points. I would like to claim that this is not a very “good” triangulation. This algorithm tends to produce lots of long, slivery triangles, and a really uneven distribution of edge counts across different vertices – some vertices have way more edges than they need to. Here’s a different triangulation. These are the exact same points, but I triangulated them smarter:
July 11, 2022 Visualizing Delaunay Triangulation Take a look at this: This is a triangulation of a set of random points, such that all the points are connected to one another, all of the faces are triangles, and the edges include the convex hull of the points. I would like to claim that this is not a very "good" triangulation. This algorithm tends to produce lots of long, slivery triangles, and a really uneven distribution of edge counts across different vertices - some vertices have way more edges than they need to. Here's a different triangulation. These are the exact same points, but I tria
saved by
related reading
- Visualizing Algorithmsbost.ocks.org
- Angle trisection using origamidivisbyzero.com
- Neural Networks, Manifolds, and Topology -- colah's blogcolah.github.io
- Fast Polygon Triangulation Based on Seidel's Algorithmgamma.cs.unc.edu
- Minimum-weight triangulation - Wikipediaen.wikipedia.org
- Ray Tracing in One Weekendraytracing.github.io
- Voronoi diagram - Wikipediaen.wikipedia.org
- Why Rendering a Triangle is Complicated | LiamHzliamhz.com
- LearnOpenGL - Hello Trianglelearnopengl.com
- A point in many trianglesborisbukh.org
- Simplex - Wikipediaen.wikipedia.org
- Polygon rectangulation, part 1: Minimum number of rectangles | Nanoexplanationsnanoexplanations.wordpress.com