Show HN: An algorithm for smoothly filling holes in 3D meshes

Re:Show HN: An algorithm for smoothly filling holes in 3D me... by bhouston on Monday February 26, 2018 @09:02PM (#16470590)

This 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.

[ Parent | on HN ]

Re:Show HN: An algorithm for smoothly filling holes in 3D me... by erkaman on Monday February 26, 2018 @11:46PM (#16471130)

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.

[ Parent | on HN ]

Re:Show HN: An algorithm for smoothly filling holes in 3D me... by pducks32 on Tuesday February 27, 2018 @04:10AM (#16472104)

Yea I really liked your post because of that focus. I use variation all calculus quite a lot for non-programming stuff and it’s really allowed me to understand things like NNs way better and I think so many other programmers could benefit from a small bit of it.

[ Parent | on HN ]

Re:Show HN: An algorithm for smoothly filling holes in 3D me... by electricslpnsld on Monday February 26, 2018 @09:40PM (#16470723)

> 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!

[ Parent | on HN ]

Re:Show HN: An algorithm for smoothly filling holes in 3D me... by nicklaf on Monday February 26, 2018 @10:35PM (#16470893)

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.

[ Parent | on HN ]

Re:Show HN: An algorithm for smoothly filling holes in 3D me... by erkaman on Monday February 26, 2018 @11:47PM (#16471135)

I also appreciate the provided references.

[ Parent | on HN ]

Re:Show HN: An algorithm for smoothly filling holes in 3D me... by mkl on Monday February 26, 2018 @11:56PM (#16471167)

3D scanners are not the only source of mesh data. 3D modelling, simulation, etc. can produce consistent meshes which you may still want to fill holes in. I agree this isn't novel, but it may be useful in some instances.

[ Parent | on HN ]

Re:Show HN: An algorithm for smoothly filling holes in 3D me... by rsp1984 on Tuesday February 27, 2018 @08:45AM (#16473238)

I agree with you on the first part. However keep in mind that sometimes it's better to subdivide a problem and find better solutions for each sub-part.

The case you outlined can be subdivided into (non-dense / non-watertight) surface reconstruction followed by hole-filling on the extracted surface.

Also, the given algorithm could still be used for filling holes in the data of a single-frame of a 3D sensor, where you "only" deal with noise, but not with overlapping data "layers".

[ Parent | on HN ]