Timeline for How to determine if a point is within a concave 3D polyhedron?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 7, 2020 at 3:26 | history | edited | Tim Laska | CC BY-SA 4.0 | Incorportated Henrik's UnitStep suggestion from the comments. |
| Jun 6, 2020 at 14:16 | comment | added | Henrik Schumacher | "will try to make the polygons isotropic."Ah right, I get it. This is a good thing for many tasks, but for this one, it is just not necessary. | |
| Jun 6, 2020 at 14:01 | comment | added | Tim Laska | @HenrikSchumacher Thank you very much for your insight. I will try to incorporate your suggestions soon. I suspect the triangle count changes as ToBoundaryMesh will try to make the polygons isotropic. | |
| Jun 6, 2020 at 6:45 | comment | added | Henrik Schumacher | Mapping srdf makes it quite slow. {True, False}[[UnitStep[srdf[crd]] + 1]] is almost 4 times faster; and so is RegionMember. I don't know what ToBoundaryMesh does exactly, but for some reason, using the region Ras created by me instead of bmr seems to be slightly faster (and leads to the same results). | |
| Jun 5, 2020 at 23:49 | history | answered | Tim Laska | CC BY-SA 4.0 |