Show HN: An algorithm for smoothly filling holes in 3D meshes
erkaman.github.io
Show HN: An algorithm for smoothly filling holes in 3D meshes
1–10 of 19 posts
Re: Show HN: An algorithm for smoothly filling holes in 3D meshes
#2A blog post from me about smoothly filling holes in a 3D mesh. Small demo application can be found here:
Re: Show HN: An algorithm for smoothly filling holes in 3D meshes
#3This honestly seems like a standard approach to smoothing for computer vision (not to say, this isn't different in a technical sense).
Re: Show HN: An algorithm for smoothly filling holes in 3D meshes
#4A blog post from me about smoothly filling holes in a 3D mesh. Small demo application can be found here: https://github.com/Erkaman/hole_fixer
really interesting, thanks for the post ^^
Re: Show HN: An algorithm for smoothly filling holes in 3D meshes
#5My first thought was, this will be great for fixing the annoying gaps created by bad STL exports.
Re: Show HN: An algorithm for smoothly filling holes in 3D meshes
#6This is sort of neat but not really useful and not novel. The reason it isn't novel is that people have been smoothly filling holes via various polynomials and other smooth curves for the last twenty years. I wrote my first attempt in 1997 as an undergraduate.
In real life you have contradictory information given you to from a 3D scanner. there are multiple surfaces that seem to intersect and do not technically make sense and you have to make a smooth singular surface from this. Thus the real calculation is volumetric and best fit between surfaces all the while trying to maintain color/texture information.
Stuff like this:
http://sites.fas.harvard.edu/~cs277/papers/mlsSoup.pdf
https://members.loria.fr/Bruno.Levy/papers/VSDM_IMR_2011.pdf
Basically this solution is a toy solution for an idealized problem that is great for a thought experience for undergraduates. So it is great for that.
Re: Show HN: An algorithm for smoothly filling holes in 3D meshes
#7This is sort of neat but not really useful and not novel. The reason it isn't novel is that people have been smoothly filling holes via various polynomials and other smooth curves for the last twenty years. I wrote my first attempt in 1997 as an undergraduate. In real life you have contradictory information given you to from a 3D scanner. there are multiple surfaces that seem to intersect and do not technically make…
> This is sort of neat but not really useful and not novel.
Who said it had to be? It is a blog post, not a SIGGRAPH paper!
Re: Show HN: An algorithm for smoothly filling holes in 3D meshes
#8This is sort of neat but not really useful and not novel. The reason it isn't novel is that people have been smoothly filling holes via various polynomials and other smooth curves for the last twenty years. I wrote my first attempt in 1997 as an undergraduate. In real life you have contradictory information given you to from a 3D scanner. there are multiple surfaces that seem to intersect and do not technically make…
> This is sort of neat but not really useful and not novel. Who said it had to be? It is a blog post, not a SIGGRAPH paper!
Maybe it was not polite of him to dismiss the blog post (and maybe that wasn't his intention), but I do appreciate that he provided references to prior art, and also took the time to put them in context.
Re: Show HN: An algorithm for smoothly filling holes in 3D meshes
#9I did almost the same thing in a very different way as part of my PhD research: https://imgur.com/a/k6AQi
I did it by representing the surface implicitly with radial basis function approximations, which can't produce surfaces with holes (well, edges - a torus is fine).
Re: Show HN: An algorithm for smoothly filling holes in 3D meshes
#10This is sort of neat but not really useful and not novel. The reason it isn't novel is that people have been smoothly filling holes via various polynomials and other smooth curves for the last twenty years. I wrote my first attempt in 1997 as an undergraduate. In real life you have contradictory information given you to from a 3D scanner. there are multiple surfaces that seem to intersect and do not technically make…
I agree with you mostly. I just think that this is an interesting usage of variational calculus, which is not that well understood by other programmers, so I wanted to write this article about this, in order to introduce other programmers to the topic.
And also because I thought the literature about this out there wasn't really that readable, and I always think there is value in writing expository texts like this.