DETERMINING A POSITION OF A TERMINAL
First Claim
1. An apparatus comprising:
- a processor, anda memory, said memory storing a program comprising program code said program configured to cause said apparatus, when said program is executed on said processor, to perform checking if an intersection of all areas of a set of areas that are associated with one or more communication nodes and represent and/or limit possible positions of a terminal is potentially non-empty, wherein each of said areas is associable with a respective bounding box that is one of a rectangle and a rectangular cuboid, and wherein said intersection is defined to be potentially non-empty if an intersection of all of said bounding boxes would be non-empty; and
further configured to cause said apparatus, when said program is executed on said processor, to perform determining a position of said terminal in dependence on a result of the checking if said intersection of all areas of said set of areas is potentially non-empty.
4 Assignments
0 Petitions
Accused Products
Abstract
It is disclosed an apparatus, a method and a computer program for determining a position of a terminal. It is checked if an intersection of all areas of a set of areas that are associated with one or more communication nodes and represent and/or limit possible positions of a terminal is potentially non-empty. Each of the areas is associable with a respective bounding box. The intersection is defined to be potentially non-empty if an intersection of all of the bounding boxes would be non-empty. A position of the terminal is determined in dependence on a result of the checking if the intersection of all areas of the set of areas is potentially non-empty.
-
Citations
33 Claims
-
1. An apparatus comprising:
-
a processor, and a memory, said memory storing a program comprising program code said program configured to cause said apparatus, when said program is executed on said processor, to perform checking if an intersection of all areas of a set of areas that are associated with one or more communication nodes and represent and/or limit possible positions of a terminal is potentially non-empty, wherein each of said areas is associable with a respective bounding box that is one of a rectangle and a rectangular cuboid, and wherein said intersection is defined to be potentially non-empty if an intersection of all of said bounding boxes would be non-empty; and
further configured to cause said apparatus, when said program is executed on said processor, to perform determining a position of said terminal in dependence on a result of the checking if said intersection of all areas of said set of areas is potentially non-empty. - View Dependent Claims (2, 3, 4, 7, 8, 9, 11, 12, 13, 14, 15, 33)
-
-
5. (canceled)
-
6. (canceled)
-
10. (canceled)
-
16. A method comprising:
-
checking if an intersection of all areas of a set of areas that are associated with one or more communication nodes and represent and/or limit possible positions of a terminal is potentially non-empty, wherein each of said areas is associable with a respective bounding box that is one of a rectangle and a rectangular cuboid, and wherein said intersection is defined to be potentially non-empty if an intersection of all of said bounding boxes would be non-empty; determining a position of said terminal in dependence on a result of the checking if said intersection of all areas of said set of areas is potentially non-empty. - View Dependent Claims (17, 18, 21, 22, 23, 32)
-
-
19. (canceled)
-
20. (canceled)
-
24. (canceled)
-
25. (canceled)
-
26. (canceled)
-
27. (canceled)
-
28. (canceled)
-
29. (canceled)
-
30. (canceled)
-
31. (canceled)
Specification