If you appreciate the mathematical elegance of Delaunay Triangulation but need your final mesh topology to stick to specific constraints, Constrained Delaunay Triangulation could be the solution you're looking for.
https://t.co/G7mkB8pRem
#algorithms#computationalgeometry
Continuing on the topic of triangulation, have you heard of Delaunay triangulation? It's a robust algorithm that can improve the topology of your mesh. Learn more about the benefits of Delaunay triangulation in the latest post https://t.co/TDpAZG6HdO
@mrezababaee@_AlecJacobson @sellan_s @wenzeljakob CGAL has a GPL license. If you need something free for commercial use, Open3D has MIT, and it has boolean operations on meshes. LibIGL has much more other features with meshes, though.
@FreyaHolmer Just mentioning. I was recently writing my own boolean calculations for non-manifold shapes (in my case, those are meshes out of point clouds, so no primitive figures). Indeed it is challenging and has many edge cases. However, found that the latest Open3D has everything I needed
@royvanrijn In my experience, any triangulation with constraints leads to illegal edges. Therefore it is a good idea to check on half edges and swap them if needed.
Have you ever tried to calculate how many cans of paint you need to paint a wall? Here I’m explaining the Ear-Clipping algorithm to help you solve the problem.
#triangulation#geometry#Algorithms
https://t.co/WppoWh75dc
@royvanrijn Not hard, actually. It is named detecting “illegal” edges. And there are always a finite amount of iterations to perform the optimization. Or use another triangulation algorithm in first place (-; Iso-points also quite helpful things.
ru propaganda announced strikes not only on critical infrastructure. And here it is. Part of the apartment building is gone. They actually admit that they are committed to killing civilians at large. Pure terrorism. Which requires strong answers from the international community!
@akella@mlperego Just a random thought, can you achieve the same by turning on backface cooling and pointing all face normals into to the center. Will the effect be the same? If so, you don't need to duplicate meshes.
@fjfaase Fair enough, you can have multiple ways of solving a single task. As for the sweep line, I’m writing about Delaunay triangulation, which also works well with holes. And the next one is Constrained Delaunay, for keeping the path of a polygon. Bear with me. I hope for your feedback
@Notwebct Also, just curious if you have an abstract picture, not a square wall. How do you calculate the number of cans then only experience or do math?
@Notwebct Haha, funny. Good, you can do it. I’m the kind of nerd who prefers making a machine which does the job for you or at least automates as much as possible. At that stage, you need a deterministic way for computations. …
@Rarame Well, not exactly. If I draw a square around the polygon from the example, I will get 49 sq m. It is 12 cans more than I would need. On average, one can cost 16 euros, thus 192 euros for nothing. Therefore, the square doesn’t work