Here is a mesh I computed in order to evoke the new Gridcoin logo
(thanks @joshoeah).
First, I decomposed the logo into elementary shapes like lines, circles and meeting points.
Then I computed the distance function to the global shape defined as the minimum of all the distances from those elementary shapes.
Then I ran a mesher which adapts to the metrics defined by that function.
Et voilà!
By Zipity.grc (Own work) [CC BY-SA 4.0], via Wikimedia Commons
The hardest part (beside writing the mesher) was to tweak half a dozen of coefficients in order to stress the 'active' locations -- the shape itself -- from the backgound by varying triangle density.
The result has T = 7202 triangles, and as you can count there are B = 12 border edges (and 12 border vertices obviously).
Fun fact : this is enough to compute E the total number of edges!
Indeed, as
for any triangular mesh, we have E = 10809 edges. And now, since the Euler characteristic is 1 for a planar mesh
so V = 3608 vertices.
(edit: hints for a proof here)