1. Fractional Cascading
1
Fractional Cascadingโฆ
โข Data structuring technique designed to speed up a search for nodes
in the given rectangle area
โข Binary search on the Y-axis is automatically achieved by
implementing the binary search on the X-axis
Computation Cost Space Complexity
๐ช log ๐ + ๐ ๐ช ๐ log ๐
๐:number of the data
๐:number of nodes in the given rectangle area
B,E
3. Fractional Cascading (ๆง็ฏ)
1. ๐ฅๅบงๆจใซใคใใฆไบๅๆจใไฝๆ
ใใ. (*๐ฅๅบงๆจใๅใใใผใฟใซ
ใคใใฆใฏ, (๐ฅ, ๐ฆ)ใซ้ขใใ่พๆธ
ๅผ้ ๅบใซใใๆฏ่ผใใ)
2. ใใฎใจใ็ฏ็นใซ, ็ฏ็นใซๅซใพ
ใใใใผใฟใ(๐ฆ, ๐ฅ)ใง่พๆธๅผ
ใฝใผใใใ้ ๅใไป้ๆง้
ใจใใฆๆใใใ
G B A E F D C
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
Root
4. Fractional Cascading (ๆง็ฏ)
1. ๐ฅๅบงๆจใซใคใใฆไบๅๆจใไฝๆ
ใใ. (*๐ฅๅบงๆจใๅใใใผใฟใซ
ใคใใฆใฏ, (๐ฅ, ๐ฆ)ใซ้ขใใ่พๆธ
ๅผ้ ๅบใซใใๆฏ่ผใใ)
2. ใใฎใจใ็ฏ็นใซ, ็ฏ็นใซๅซใพ
ใใใใผใฟใ(๐ฆ, ๐ฅ)ใง่พๆธๅผ
ใฝใผใใใ้ ๅใไป้ๆง้
ใจใใฆๆใใใ
G B A E F D C
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
Root
5. Fractional Cascading (ๆง็ฏ)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
B A C(๐, ๐)
Root
1. ๐ฅๅบงๆจใซใคใใฆไบๅๆจใไฝๆ
ใใ. (*๐ฅๅบงๆจใๅใใใผใฟใซ
ใคใใฆใฏ, (๐ฅ, ๐ฆ)ใซ้ขใใ่พๆธ
ๅผ้ ๅบใซใใๆฏ่ผใใ)
2. ใใฎใจใ็ฏ็นใซ, ็ฏ็นใซๅซใพ
ใใใใผใฟใ(๐ฆ, ๐ฅ)ใง่พๆธๅผ
ใฝใผใใใ้ ๅใไป้ๆง้
ใจใใฆๆใใใ
6. Fractional Cascading (ๆง็ฏ)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C(๐, ๐) (๐, ๐)
Root
1. ๐ฅๅบงๆจใซใคใใฆไบๅๆจใไฝๆ
ใใ. (*๐ฅๅบงๆจใๅใใใผใฟใซ
ใคใใฆใฏ, (๐ฅ, ๐ฆ)ใซ้ขใใ่พๆธ
ๅผ้ ๅบใซใใๆฏ่ผใใ)
2. ใใฎใจใ็ฏ็นใซ, ็ฏ็นใซๅซใพ
ใใใใผใฟใ(๐ฆ, ๐ฅ)ใง่พๆธๅผ
ใฝใผใใใ้ ๅใไป้ๆง้
ใจใใฆๆใใใ
7. Fractional Cascading (ๆง็ฏ)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C
B A
(๐, ๐) (๐, ๐)
(๐, ๐)
Root
1. ๐ฅๅบงๆจใซใคใใฆไบๅๆจใไฝๆ
ใใ. (*๐ฅๅบงๆจใๅใใใผใฟใซ
ใคใใฆใฏ, (๐ฅ, ๐ฆ)ใซ้ขใใ่พๆธ
ๅผ้ ๅบใซใใๆฏ่ผใใ)
2. ใใฎใจใ็ฏ็นใซ, ็ฏ็นใซๅซใพ
ใใใใผใฟใ(๐ฆ, ๐ฅ)ใง่พๆธๅผ
ใฝใผใใใ้ ๅใไป้ๆง้
ใจใใฆๆใใใ
8. Fractional Cascading (ๆง็ฏ)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C
B A C
(๐, ๐) (๐, ๐)
(๐, ๐) C
Root
1. ๐ฅๅบงๆจใซใคใใฆไบๅๆจใไฝๆ
ใใ. (*๐ฅๅบงๆจใๅใใใผใฟใซ
ใคใใฆใฏ, (๐ฅ, ๐ฆ)ใซ้ขใใ่พๆธ
ๅผ้ ๅบใซใใๆฏ่ผใใ)
2. ใใฎใจใ็ฏ็นใซ, ็ฏ็นใซๅซใพ
ใใใใผใฟใ(๐ฆ, ๐ฅ)ใง่พๆธๅผ
ใฝใผใใใ้ ๅใไป้ๆง้
ใจใใฆๆใใใ
9. Fractional Cascading(ๆง็ฏ)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C
B A C
A B
E D G F
E D G F
(๐, ๐) (๐, ๐)
(๐, ๐) C (๐, ๐) (๐, ๐)
A B E D G F
Root
1. ๐ฅๅบงๆจใซใคใใฆไบๅๆจใไฝๆ
ใใ. (*๐ฅๅบงๆจใๅใใใผใฟใซ
ใคใใฆใฏ, (๐ฅ, ๐ฆ)ใซ้ขใใ่พๆธ
ๅผ้ ๅบใซใใๆฏ่ผใใ)
2. ใใฎใจใ็ฏ็นใซ, ็ฏ็นใซๅซใพ
ใใใใผใฟใ(๐ฆ, ๐ฅ)ใง่พๆธๅผ
ใฝใผใใใ้ ๅใไป้ๆง้
ใจใใฆๆใใใ
10. Fractional Cascading(ๆง็ฏ)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
G B A E F D C
G E F DB A C
3. ไป้ๆง้ ใซใคใใฆ, ๅ่ฆ็ด ใ
ใไธใฎๅฑคใฎ้ ๅใซๅใใฆ,
minmaxใใคใณใฟใจ
maxminใใคใณใฟใๅผตใ
minmax(maxmin)ใใคใณใฟ
โฏ ๅฏพ่ฑกใฎ้ ๅใฎไธญใง,ใใฎ่ฆ
็ด ใใใๅคงใใช(ๅฐใใช)่ฆ็ด
ใฎไธญใงๆๅฐ(ๆๅคง)ใฎ่ฆ็ด ใซๅผต
ใใใ
(ไธ่จใฎใใใช่ฆ็ด ใๅญๅจใ
ใชใๅ ดๅใฏ, Nullใใคใณใฟใจ
ใชใ)
Null
minmaxใใคใณใฟ maxminใใคใณใฟ
11. Fractional Cascading(ๆข็ดข)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
G B A E F D C
G E F DB A C
B A C
A B
E D G F
E D G F
4. ๆข็ดข็ฏๅฒใฎใฏใจใช
๐ฅ ๐๐๐, ๐ฅ ๐๐๐ฅ ร ๐ฆ ๐๐๐, ๐ฆ ๐๐๐ฅ
ใๅใๅใ.
5. [๐ฆ ๐๐๐, ๐ฆ ๐๐๐ฅ]ใฎ็ฏๅฒใซใใ
ใใผใ็ฏๅฒใไบๅๆข็ดขใซใ
ใ่ฆใคใใ
๐ฆmin
๐ฆm๐๐ฅ
G B A E F D C
ใใผใฟiใฎๅบงๆจใ(๐ฅ๐, ๐ฆ๐)ใจ่กจใใจ
๐ฆ ๐๐๐, โโ โค ๐ฆ ๐ต, ๐ฅ ๐ต โค ๐ฆ ๐ธ, ๐ฅ ๐ธ โค (๐ฆ ๐๐๐ฅ, +โ)
ใใผใฟBใฎminmaxใใคใณใฟๅ ใ๐
ใใผใฟEใฎmaxminใใคใณใฟๅ ใ๐ใจใใใจ
๐ฆ ๐ต, ๐ฅ ๐ต โค (๐ฆ ๐, ๐ฅ ๐), ๐ฆ ๐, ๐ฅ ๐ โค (๐ฆ ๐, ๐ฅ ๐)
ใชใฎใง,
๐ฆ ๐๐๐, โโ โค ๐ฆ ๐, ๐ฅ ๐ โค ๐ฆ ๐, ๐ฅ ๐ โค ๐ฆ ๐๐๐ฅ, +โ
ใๆ็ซ
12. Fractional Cascading(ๆข็ดข)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C
B A C
A B
E D G F
E D G F
(๐, ๐) (๐, ๐)
(๐, ๐) C (๐, ๐) (๐, ๐)
A B E D G F
Split
Root
6. ๐ฅๅบงๆจใ[๐ฅ ๐๐๐, ๐ฅ ๐๐๐ฅ]ใๅ
ๅฒใใ็ฏ็นใๆข็ดขใใ(ใ
ใใSplit Rootใจๅผใถ)
๐ฆmin
๐ฆm๐๐ฅ
13. Fractional Cascading(ๆข็ดข)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C
B A C
A B
E D G F
E D G F
(๐, ๐) (๐, ๐)
(๐, ๐) C (๐, ๐) (๐, ๐)
A B E D G F
Split
Root
7. ๐ฅ ๐๐๐ใซใคใใฆ, ไบๅๆข็ดข
ใ่กใ. (๐ฅ, ๐ฆ)ใซใคใใฆไบ
ๅๆจใไฝๆใใฆใใใฎใง,
SplitRootใฎๅทฆ้จๅๆจใซใค
ใใฆ, (๐ฅ ๐๐๐, โโ)ใใใๅคง
ใใใใผใใๆข็ดขใใ
๐ฆmin
๐ฆm๐๐ฅ
ไปๅใฏ๐ฅ ๐๐๐ = 1.5ใจใใ
14. Fractional Cascading(ๆข็ดข)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C
B A C
A B
E D G F
E D G F
(๐, ๐) (๐, ๐)
(๐, ๐) C (๐, ๐) (๐, ๐)
A B E D G F
Split
Root
8. ใใฎใจใใซไป้ๆง้ ใฎ
maxmin, minmaxใใคใณใฟ
ใ่พฟใใใจใง, ๐ฆๅบงๆจใ
[๐ฆ ๐๐๐, ๐ฆ ๐๐๐ฅ]ใซๅ ฅใใใผใฟ
ใๆข็ดขใใ
๐ฆmin
๐ฆm๐๐ฅ
minmax
ใใคใณใฟ
maxmin
ใใคใณใฟ
(1.5, โโ) โค (4 , 8)
15. Fractional Cascading(ๆข็ดข)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C
B A C
A B
E D G F
E D G F
(๐, ๐) (๐, ๐)
(๐, ๐) C (๐, ๐) (๐, ๐)
A B E D G F
Root
๐ฆmin
๐ฆm๐๐ฅ
minmax
ใใคใณใฟ
maxmin
ใใคใณใฟ(1.5, โโ)
โค (2 , 2)
8. ใใฎใจใใซไป้ๆง้ ใฎ
maxmin, minmaxใใคใณใฟ
ใ่พฟใใใจใง, ๐ฆๅบงๆจใ
[๐ฆ ๐๐๐, ๐ฆ ๐๐๐ฅ]ใซๅ ฅใใใผใฟ
ใๆข็ดขใใ
16. Fractional Cascading(ๆข็ดข)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C
B A C
A B
E D G F
E D G F
(๐, ๐) (๐, ๐)
(๐, ๐) C (๐, ๐) (๐, ๐)
A B E D G F
Root
๐ฆmin
๐ฆm๐๐ฅ
ๅ ฑๅ
minmax
ใใคใณใฟ
maxmin
ใใคใณใฟ
(1.5, โโ)
โฅ (1 , 2)
8. ใใฎใจใใซไป้ๆง้ ใฎ
maxmin, minmaxใใคใณใฟ
ใ่พฟใใใจใง, ๐ฆๅบงๆจใ
[๐ฆ ๐๐๐, ๐ฆ ๐๐๐ฅ]ใซๅ ฅใใใผใฟ
ใๆข็ดขใใ
17. Fractional Cascading(ๆข็ดข)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C
B A C
A B
E D G F
E D G F
(๐, ๐) (๐, ๐)
(๐, ๐) C (๐, ๐) (๐, ๐)
A B E D G F
Root
๐ฆmin
๐ฆm๐๐ฅ
ๅ ฑๅ
ใใ
8. ใใฎใจใใซไป้ๆง้ ใฎ
maxmin, minmaxใใคใณใฟ
ใ่พฟใใใจใง, ๐ฆๅบงๆจใ
[๐ฆ ๐๐๐, ๐ฆ ๐๐๐ฅ]ใซๅ ฅใใใผใฟ
ใๆข็ดขใใ
18. Fractional Cascading(ๆข็ดข)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C
B A C
A B
E D G F
E D G F
(๐, ๐) (๐, ๐)
(๐, ๐) C (๐, ๐) (๐, ๐)
A B E D G F
Root
๐ฆmin
๐ฆm๐๐ฅ
9. ๐ฅ ๐๐๐ฅใซใคใใฆ, ไบๅๆข็ดข
ใ่กใ. (๐ฅ, ๐ฆ)ใซใคใใฆไบ
ๅๆจใไฝๆใใฆใใใฎใง,
SplitRootใฎๅณ้จๅๆจใซใค
ใใฆ, (๐ฅ ๐๐๐, โโ)ใใใๅคง
ใใใใผใใๆข็ดขใใ
19. Fractional Cascading(ๆข็ดข)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C
B A C
A B
E D G F
E D G F
(๐, ๐) (๐, ๐)
(๐, ๐) C (๐, ๐) (๐, ๐)
A B E D G F
Root
๐ฆmin
๐ฆm๐๐ฅ
10. ใใฎใจใใซไป้ๆง้ ใฎ
maxmin, minmaxใใคใณใฟ
ใ่พฟใใใจใง, ๐ฆๅบงๆจใ
[๐ฆ ๐๐๐, ๐ฆ ๐๐๐ฅ]ใซๅ ฅใใใผใฟ
ใๆข็ดขใใ
20. Fractional Cascading(ๆข็ดข)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C
B A C
A B
E D G F
E D G F
(๐, ๐) (๐, ๐)
(๐, ๐) C (๐, ๐) (๐, ๐)
A B E D G F
Root
๐ฆmin
๐ฆm๐๐ฅ
ๅ ฑๅ
10. ใใฎใจใใซไป้ๆง้ ใฎ
maxmin, minmaxใใคใณใฟ
ใ่พฟใใใจใง, ๐ฆๅบงๆจใ
[๐ฆ ๐๐๐, ๐ฆ ๐๐๐ฅ]ใซๅ ฅใใใผใฟ
ใๆข็ดขใใ
21. Fractional Cascading(ๆข็ดข)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C
B A C
A B
E D G F
E D G F
(๐, ๐) (๐, ๐)
(๐, ๐) C (๐, ๐) (๐, ๐)
A B E D G F
Root
๐ฆmin
๐ฆm๐๐ฅ
ๅ ฑๅ
ใใ
10. ใใฎใจใใซไป้ๆง้ ใฎ
maxmin, minmaxใใคใณใฟ
ใ่พฟใใใจใง, ๐ฆๅบงๆจใ
[๐ฆ ๐๐๐, ๐ฆ ๐๐๐ฅ]ใซๅ ฅใใใผใฟ
ใๆข็ดขใใ
22. Fractional Cascading(ๆข็ดข)
๐ฅ
๐ฆ
1 2 3 4 5 6 7 8
1
2
3
4
5
6
7
8
(๐, ๐) G B A E F D C
G E F DB A C
B A C
A B
E D G F
E D G F
(๐, ๐) (๐, ๐)
(๐, ๐) C (๐, ๐) (๐, ๐)
A B E D G F
Root
๐ฆmin
๐ฆm๐๐ฅ
ๆข็ดข
็ตไบ
ๆข็ดข้ ๅใ
Noneใชใฎใง
10. ใใฎใจใใซไป้ๆง้ ใฎ
maxmin, minmaxใใคใณใฟ
ใ่พฟใใใจใง, ๐ฆๅบงๆจใ
[๐ฆ ๐๐๐, ๐ฆ ๐๐๐ฅ]ใซๅ ฅใใใผใฟ
ใๆข็ดขใใ
Editor's Notes
Now letโs move on to the technique finding neighborhood of a GPS
For each GPS data, we have to carry out a fast search for the neighborhood
in order to construct the time-expanded graph
In our research, we employ a fractional cascading
which is data structuring technique designed to speed up a search for nodes in the given rectangle area
The most important strategy of this data structure is that
binary search on the Y-axis is automatically achieved by implementing the binary search on the X-axsisIn stead of high space complexity, it accelerates the neighborhood serch