| Sorting £ Triangulation |
|
|
|
|
|
|
|
|
|
|
|
|
|
| Claim:
Sorting £ Triangulation |
||||||||||||
| Proof: |
||||||||||||
| • | Convert the
initial numbers |
|||||||||||
| into points on
the x-axis |
||||||||||||
| • | Add a new point
at (0,-1) |
|||||||||||
| • | Form the
triangulation of |
|||||||||||
| these points |
||||||||||||
| • | Find the
leftmost point on the |
|||||||||||
| x-axis |
||||||||||||
| • | We can report
the numbers |
|||||||||||
| in order by
traversing the |
||||||||||||
| triangulation
graph |
||||||||||||
|
|
|
| Conclusion:
Triangulation |
||
| requires
W(n log n) time |
||
| CS409 - Spring
2000 |
| 9 |