1
$\begingroup$

While the original question Convex triangulations was aimed at the existence and calculation of convex triangulations of a given set of $n$ points in the Euclidean plane, I would like to ask the opposite

Question:

where do pointsets, that come close to the ideal of having a convex Delaunay triangulation, "naturally" occur?


It appears to me that the pointsets that are generated via Weighted Voronoi Stippling algorithms diagrams or the nuclei of 2D biological cell structures are almost free of non-convex maximal unions of Delaunay triangles with a common inner points as a vertex.

Improve this question
$\endgroup$
1
  • $\begingroup$ Perhaps the more fruitful direction is to try to expand @JanKyncl's comment at the originating posting that internal degrees need to be $\ge 5$, to understand the structure of these triangulations. Maybe only then will it be clearer where these "naturally occur." $\endgroup$
    – Joseph O'Rourke
    Commented Mar 1, 2020 at 1:01

0

Reset to default

You must log in to answer this question.

Browse other questions tagged .