Checking if a solid part is within a non-cancollide part WITHOUT USING TOUCH EVENTS

[1Joeb (joeberson)]

No touch events okay? They are far too unreliable for what I need this for.

There has to be some way to check if a solid part is within another part that is non-cancollide.

At this point I could care less about performance. I have hit this wall far too many times and I am getting sick of it.

Is there any possible way? And I mean ANY!

[inHeadspace (vee)]

If it’s a regular part (not a ball, union, mesh, wedge, or cylindar), you can use Region3.

Create a region at the part’s position and the same size as the part, and check for parts within that region.

[Stickmasterluke]

Why do you not want to use touched events?

One way you could do it is with GetTouchingParts ( )

Make a clone of the non-collidable part, set it to canCollide, and put it in workspace. Get it’s touching parts, then destroy it. If your solid part is in the list, then it’s a hit.

There are other solutions aswell, but you should supply more details and some relative context if you want to find the best solution.

[1Joeb (joeberson)]

Touch events do not respond well, atleast the TouchEnded event.

[IdiomicLanguage]

You may be interested in my GJK distance and intersection module. It allows for easy intersection tests between any convex shapes, including those without points (spheres, circles) in up to three dimensions. In a recent test and with some recent optimizations, detecting a sphere resting on a baseplate runs in about half the time a call to print takes, and when the ball is not touching it can detect the separation very, very quickly (for a Lua program, that is).

Here are some of the topics I’ve mentioned it in. Some include examples usage while others describe the process.

Checking if a part is touching another part every .1 seconds?

I’ve tested two ways of doing it and found both to be reliable. The first is using my GJK distance and intersection module. If you are not familiar with the Gilbert-Johnson-Kerthi algorithm, basically you make a “support” function for each of the primitives to test (the part and the sphere in this case). The support function is called with a direction and should return the point on the primitive furthest in that direction. For a part, it will always be one of its corners. For a sphere, it will b…

Is it possible to get all parts intersecting a Ray?

I have a GJK distance and intersection implementation. That should work until a c++ implementation is made. I ran into issues like this years ago (particularly when working on my navigation mesh pathfinder). Below is pretty much all the code you need. You could remove the spherical check, since the maximum number of parts FindPartsInRegion3 returns is relatively small. I’d recommend replacing FindPartsInRegion3 with my AABB structure if the parts wont be moving around too much. --< BEWARE >--…

Custom overlapping part checks

I noticed three problems looking over your code. First, it seems like when calculating X0 to Z1 the size is sometimes divided by two, and sometimes not. I’d recommend setting Size to the PrimaryPart’s Size divided by two instead of doing it multiple times later. Second, this is taking the middle cross-section of the parts; any pitch or roll will cause invalid results. A slight note too, Vector3 could be used instead of making new CFrames. Third, unfortunately the overlap tests alone are not suff…

[buildthomas]

I’ve seen you post multiple threads over the past week regarding raycasts, touched events, etc. This seems like XY problem behavior. You should try posting a thread with the fundamental problem that you are wanting to solve, not about the solutions that you think will solve the problem.