- Messages
- 217
- Country

Hi there,
I'm desperately looking forward to get your advice and recommendations to materialize an algorithm which, at a later stage, I could programmatically add to my project... Here is the case:
Imagine an arbitrary point (Point X) in space with the following properties:
# has coordinates
# lies on a 2D-surface
# is stationary
# belongs to a single area (boundary coordinates of which are also known) at any given time. Namely, it's the only "child" of its "parent" element. Again, if it doesn't sit in one area, it definitely sits inside another one!
An area is NOT a simple square, quadrangle, or a circle but instead is an irregular shape.
Now, my question is: How can I determine if Point X lies inside that particular area and NOT the adjacent one?!? I need a kind of a "TRUE" (inside) or "FALSE" (outside) type of an algorithm, if possible. See the attached image to better visualize the problem.
PS: I perused a possibility of dealing with the Point in Polygon (PIP) problem (especially, the "ray casting algorithm" is quite smart!) but it doesn't seem to be a solution since (i) segments of the area boundaries may have curvatures; (ii) areas may be adjacent to each other.
Thank you very much in advance!!!
I'm desperately looking forward to get your advice and recommendations to materialize an algorithm which, at a later stage, I could programmatically add to my project... Here is the case:
Imagine an arbitrary point (Point X) in space with the following properties:
# has coordinates
# lies on a 2D-surface
# is stationary
# belongs to a single area (boundary coordinates of which are also known) at any given time. Namely, it's the only "child" of its "parent" element. Again, if it doesn't sit in one area, it definitely sits inside another one!
An area is NOT a simple square, quadrangle, or a circle but instead is an irregular shape.
Now, my question is: How can I determine if Point X lies inside that particular area and NOT the adjacent one?!? I need a kind of a "TRUE" (inside) or "FALSE" (outside) type of an algorithm, if possible. See the attached image to better visualize the problem.
PS: I perused a possibility of dealing with the Point in Polygon (PIP) problem (especially, the "ray casting algorithm" is quite smart!) but it doesn't seem to be a solution since (i) segments of the area boundaries may have curvatures; (ii) areas may be adjacent to each other.
Thank you very much in advance!!!
Attachments
Last edited:


