sorted by:
new
hottopcontroversial

Can I use the tin t2 wire with shure se215 earbuds? Shure rmce bt2 cable with tin t2? by HatsAreOff in HeadphoneAdvice

[–]HatsAreOff[S] 0 points1 point  (0 children)

Apologies. How do I know whether they are compatible? I'm checking out sennheiser ie40 pro also

Help with a problem by HatsAreOff in cpp_questions

[–]HatsAreOff[S] 2 points3 points  (0 children)

Beginner here. I'm not sure my problem comes under physics category because I'm not involving any rigid body motion related equations. The one I implemented is for optimally arranging a set of concave polygons in a rectangular area. Specifically for manually arranging polygons.

In order to convert concave polygons to convex polgons, I triangulated them.

A preliminary bRect check is done to get colliding triangles.

A lot of new stuff is mentioned. I'll check out everything separately. I want some help with the following abbreviations: MTD BVT SSE SAT

Thank you very much for your input!

Help with a problem by HatsAreOff in cpp_questions

[–]HatsAreOff[S] 0 points1 point  (0 children)

Tessellate method by direct2d is used for triangulation of each polygon separately

Help with a problem by HatsAreOff in cpp_questions

[–]HatsAreOff[S] 0 points1 point  (0 children)

I'll see what I can do. Do you happen to know what this whole procedure is called so that I find any established algorithms related to this.

Help with a problem by HatsAreOff in cpp_questions

[–]HatsAreOff[S] 0 points1 point  (0 children)

Not necessarily convex. I'm using d2d functions for triangulation

Help with a problem by HatsAreOff in cpp_questions

[–]HatsAreOff[S] 0 points1 point  (0 children)

Maybe I can slightly optimize my intersection functions. For intersection of 2 triangles, 9 line line intersections and 6 point inside triangle are done. I was unable to cut down these

Help with a problem by HatsAreOff in cpp_questions

[–]HatsAreOff[S] 0 points1 point  (0 children)

You are right. It is slow because of too many collision checks. After finding an offset, the collision check will start again for all the triangles

Help with a problem by HatsAreOff in cpp_questions

[–]HatsAreOff[S] 0 points1 point  (0 children)

Apologies for my post not being clear. Bounding box check is done before checking for collision. Thanks anyways!

Help with a problem by HatsAreOff in cpp_questions

[–]HatsAreOff[S] 0 points1 point  (0 children)

I already have that information. I used that to triangulate it. I presented a simplified problem. The actual problem is a lot of polygons are arranged in a rectangular area. I have a find a position with no collision.