undefined | Better HN

0 pointsquelsolaar6y ago0 comments

Thank you very much! Its pretty good but its not even close to as good as the version I have in R&D.... SSL is coming, thanks for reminding me.

0 comments

codesternews6y ago

Could you tell us more about yourself and project. How would you able to do without any coworkers when many big companies tried.

quelsolaarOP6y ago

I kind of did it by accident. It was a side project that people started getting in touch over.

I think I'm very suited to solve this problem for a few reasons. I used to be a 3D artist so I know what artists want. I'm a C programmers so I can make complex things go fast, and I have done a lot of procedural 3D stuff so I know a lot of mesh processing tricks. The complexity of this is substantial. its currently around 1.5 megs of source code, not counting UIs loaders and savers or any of that. So I would say many long hours and being very focused is key. You can find more of my work at www.quelsolaar.com and @quelsolaar on twitter

sr3d6y ago

Your work is amazing. Great job! I'm super impressed. I used to do a bunch of 3D stuff but then I switched to web/mobile dev and that was it for 3D. I can see why your software is successful because it solves a very exact pain-point that is very costly and time-consuming.

spectramax6y ago

For some reason, I was pondering over the problem (with really no background in mesh/geometry algorithms) - it feels very NP-complete-like problem. It just feels hard. Could you expand on some of the details of the algorithm in terms of how these 30 algos scale? Do they scale in polynomial time or do these algos scale in non-polynomial ways but the problem space is small enough for it to compute the solution quickly. Perhaps some epoch threshold has reached and the algos bail out?

j / k navigate · click thread line to collapse