I am trying to find resources that explain an easy to implement (not necessarily optimal but reasonable runtime) algorithm for inserting Steiner points in a triangulation.

There seems to be little literature on the topic. My understanding is that different people pick different criteria to optimize, some pick triangle area, others total number of points...

The one I care about is maximizing the smallest angle, or said otherwise, making triangles approach equilateral sides.

I did find this writeup, but it is too high level. I could try reading the original papers but I was wondering if there is a less formal and more intuition based explanation of the topic that I have not found.

  • $\begingroup$ Did you dig the bibliography ? $\endgroup$
    – user16034
    Aug 12, 2023 at 9:00
  • $\begingroup$ This thesis might help. cs.cmu.edu/~quake-papers/delaunay-refinement.pdf $\endgroup$
    – Pseudonym
    Aug 12, 2023 at 11:42
  • 1
    $\begingroup$ At a first glance, this seems to be a great source including more references. $\endgroup$
    – DirkT
    Aug 16, 2023 at 5:58


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.