2010 USTA LA Tennis Open – Singles
Michael Russell was the defending champion, but he chose to compete at the French Open instead.
Donald Young defeated 6–4, 6–4 Robert Kendrick in the final.
Singles | |
---|---|
2010 USTA LA Tennis Open | |
Champion | ![]() |
Runner-up | ![]() |
Final score | 6–4, 6–4 |
Seeds
Jesse Levine (Second Round) Brian Dabul (Second Round) Kevin Kim (First Round) Donald Young (Champion) Robert Kendrick (Final) Alex Kuznetsov (Quarterfinals) Nick Lindahl (Second Round) Peter Polansky (Semifinals)
Draw
Key
- Q = Qualifier
- WC = Wild Card
- LL = Lucky Loser
- Alt = Alternate
- SE = Special Exempt
- PR = Protected Ranking
- ITF = ITF entry
- JE = Junior Exempt
- w/o = Walkover
- r = Retired
- d = Defaulted
Finals
Semifinals | Final | ||||||||||||
5 | ![]() | 7 | 6 | ||||||||||
8 | ![]() | 61 | 3 | ||||||||||
5 | ![]() | 4 | 4 | ||||||||||
4 | ![]() | 6 | 6 | ||||||||||
4 | ![]() | 3 | 6 | 6 | |||||||||
![]() | 6 | 1 | 1 | ||||||||||
Top Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() | 4 | 6 | 6 | |||||||||||||||||||||||
![]() | 6 | 1 | 3 | 1 | ![]() | 3 | 4 | ||||||||||||||||||||
![]() | 7 | 3 | 3 | ![]() | 6 | 6 | |||||||||||||||||||||
![]() | 65 | 6 | 6 | ![]() | 2 | 69 | |||||||||||||||||||||
![]() | 7 | 1 | 6 | 5 | ![]() | 6 | 7 | ||||||||||||||||||||
![]() | 5 | 6 | 4 | ![]() | 65 | 1 | |||||||||||||||||||||
Q | ![]() | 4 | 3 | 5 | ![]() | 7 | 6 | ||||||||||||||||||||
5 | ![]() | 6 | 6 | 5 | ![]() | 7 | 6 | ||||||||||||||||||||
3 | ![]() | 7 | 1 | 0 | 8 | ![]() | 61 | 3 | |||||||||||||||||||
LL | ![]() | 65 | 6 | 6 | LL | ![]() | 62 | 6 | 7 | ||||||||||||||||||
![]() | 63 | 1 | ![]() | 7 | 4 | 64 | |||||||||||||||||||||
![]() | 7 | 6 | LL | ![]() | 4 | 4 | |||||||||||||||||||||
Q | ![]() | 4 | 7 | 3 | 8 | ![]() | 6 | 6 | |||||||||||||||||||
WC | ![]() | 6 | 62 | 6 | WC | ![]() | 6 | 1 | 4 | ||||||||||||||||||
WC | ![]() | 1 | 5 | 8 | ![]() | 4 | 6 | 6 | |||||||||||||||||||
8 | ![]() | 6 | 7 |
Bottom Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
7 | ![]() | 3 | 7 | 7 | |||||||||||||||||||||||
ALT | ![]() | 6 | 65 | 65 | 7 | ![]() | 7 | 4 | 1 | ||||||||||||||||||
![]() | 4 | 1 | ![]() | 5 | 6 | 6 | |||||||||||||||||||||
![]() | 6 | 6 | ![]() | 1 | 7 | 2 | |||||||||||||||||||||
WC | ![]() | 4 | 3 | 4 | ![]() | 6 | 64 | 6 | |||||||||||||||||||
PR | ![]() | 6 | 6 | PR | ![]() | 2 | 4 | ||||||||||||||||||||
WC | ![]() | 1 | 1 | 4 | ![]() | 6 | 6 | ||||||||||||||||||||
4 | ![]() | 6 | 6 | 4 | ![]() | 3 | 6 | 6 | |||||||||||||||||||
6 | ![]() | 7 | 6 | ![]() | 6 | 1 | 1 | ||||||||||||||||||||
![]() | 5 | 2 | 6 | ![]() | 6 | 6 | |||||||||||||||||||||
Q | ![]() | 1 | 7 | 6 | Q | ![]() | 0 | 1 | |||||||||||||||||||
![]() | 6 | 62 | 4 | 6 | ![]() | 4 | 6 | 4 | |||||||||||||||||||
![]() | 6 | 2 | 64 | ![]() | 6 | 0 | 6 | ||||||||||||||||||||
![]() | 2 | 6 | 7 | ![]() | 7 | 6 | |||||||||||||||||||||
Q | ![]() | 3 | 5 | 2 | ![]() | 62 | 4 | ||||||||||||||||||||
2 | ![]() | 6 | 7 |
gollark: The chemtrail nanobot beams hiding the fake Moon will warm up your scones nicely.
gollark: If you don't have one just find a 5G tower!
gollark: SMH my head, just microwave the scönes?
gollark: Also, it really should be capable of searching a few hundred thousand nodes and JS is clearly just being hilariously inefficient, but if I use WASM I could write a better Rust implementation.
gollark: *But* I could probably make it pick positions based on a heuristic to maximize the amount of nearly-lines it has and to minimize the opponent's.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.