Promaton’s Post

In the dental domain, we are developing tools to edit the boundaries of a mesh. At first glance, this might seem straightforward, but it inevitably leads to a complex problem in mathematics and software engineering. How can we draw a path between two vertices on a mesh? Which is the most efficient path? These are the types of questions our FE team has to answer. And in this blog post they share their journey, and the implementation. #frontend #3Dmeshes #shortestpath #threejs #computergraphics

This is a good piece of art showing why it is so cool to work at an AI company as a Frontend Engineer, thank you Christian Marques for writing it! 🔔

Francis Toupin

R&D data scientist in image analysis @ Alphatec Spine / EOS Imaging

7mo

This is a very interesting blog entry. In cases where the mesh is sufficiently dense and where vertices are evenly distributed I think going through vertices to find the shortest path between two vertices makes sense. I'm wondering what do you think of the idea of walking through faces to get there faster? Imagine two triangles ABC and DBC where A and D are separated by an edge. Walking through both faces might end up being faster than going through B or C first. Of course this depends on the use case.

See more comments

To view or add a comment, sign in

Explore topics