1998 Liga Sudamericana de Básquetbol
The 1998 Liga Sudamericana de Básquetbol, or 1998 FIBA South American League, was the third edition of the second-tier tournament for professional basketball clubs from South America. The tournament began on 4 February 1998 and finished on 12 May 1998. Defending champions Atenas won their second title, defeating Brazilian club Cougar Franca in the Grand Finals.
Competition details | |||
---|---|---|---|
Season | 1998 | ||
Teams | 16 | ||
Dates | 4 February – 12 May 1998 | ||
Final positions | |||
Champions |
![]() | ||
Runners-up |
![]() | ||
Semifinalists |
![]() ![]() | ||
← 1997 1999 → |
Format
Teams were split into four groups of four teams each, and played each other in a home-and-away round-robin format. The top two teams from each group advanced to the final stage, a best-of-three direct playoff elimination where the champion was decided.
Teams
Country | Team |
---|---|
![]() | Atenas |
Boca Juniors | |
Independiente de General Pico | |
![]() | Ingavi de La Paz |
![]() | Marathon Franca |
Mogi das Cruzes | |
![]() | Universidad Católica |
Universidad de Concepción | |
![]() | Leopardos de Bucamaranga |
![]() | Ciudad de Loja |
![]() | San José |
![]() | Esofa de Lima |
![]() | Aguada |
Cordón | |
![]() | Cocodrilos de Caracas |
Guaiqueríes de Margarita |
Group stage
Group A
Pos | Team | Pld | W | L | Pts | Qualification | ATE | SAN | CON | AGU | |
---|---|---|---|---|---|---|---|---|---|---|---|
1 | ![]() |
6 | 6 | 0 | 12 | Advances to final stage | — | 112–71 | 123–86 | 92–78 | |
2 | ![]() |
6 | 3 | 3 | 9 | 59–88 | — | 86–78 | 89–86 | ||
3 | ![]() |
6 | 2 | 4 | 8 | 71–94 | 85–81 | — | 96–90 | ||
4 | ![]() |
6 | 1 | 5 | 7 | 81–89 | 86–98 | 99–72 | — |
Source: FIBA Archive
Group B
Pos | Team | Pld | W | L | Pts | Qualification | FRA | LEO | GUA | LOJ | |
---|---|---|---|---|---|---|---|---|---|---|---|
1 | ![]() |
6 | 6 | 0 | 12 | Advances to final stage | — | 116–86 | 139–114 | 147–56 | |
2 | ![]() |
6 | 3 | 3 | 9 | 73–87 | — | 110–86 | 93–78 | ||
3 | ![]() |
6 | 2 | 4 | 8 | 67–88 | 101–100 | — | 102–74 | ||
4 | ![]() |
6 | 1 | 5 | 7 | 71–103 | 71–90 | 100–94 | — |
Source: FIBA Archive
Group C
Pos | Team | Pld | W | L | Pts | Qualification | BOC | COD | UCA | ING | |
---|---|---|---|---|---|---|---|---|---|---|---|
1 | ![]() |
6 | 6 | 0 | 12 | Advances to final stage | — | 126–86 | 112–68 | 134–104 | |
2 | ![]() |
6 | 4 | 2 | 10 | 80–104 | — | 110–80 | 101–60 | ||
3 | ![]() |
6 | 2 | 4 | 8 | 101–143 | 84–87 | — | 100–96 | ||
4 | ![]() |
6 | 0 | 6 | 6 | 89–114 | 81–100 | 71–104 | — |
Source: FIBA Archive
Group D
Pos | Team | Pld | W | L | Pts | Qualification | IND | MOG | COC | ESO | |
---|---|---|---|---|---|---|---|---|---|---|---|
1 | ![]() |
6 | 6 | 0 | 12 | Advances to final stage | — | 109–106 | 130–66 | 123–62 | |
2 | ![]() |
6 | 4 | 2 | 10 | 88–96 | — | 98–77 | 143–85 | ||
3 | ![]() |
6 | 2 | 4 | 8 | 96–103 | 69–74 | — | 97–61 | ||
4 | ![]() |
6 | 0 | 6 | 6 | 61–96 | 73–99 | 87–127 | — |
Source: FIBA Archive
Final stage
Quarterfinals | Semifinals | Grand Finals | ||||||||
![]() | 2 | |||||||||
![]() | 0 | |||||||||
![]() | 2 | |||||||||
![]() | 1 | |||||||||
![]() | 2 | |||||||||
![]() | 0 | |||||||||
![]() | 0 | |||||||||
![]() | 2 | |||||||||
![]() | 2 | |||||||||
![]() | 0 | |||||||||
![]() | 1 | |||||||||
![]() | 2 | |||||||||
![]() | 2 | |||||||||
![]() | 0 | |||||||||
gollark: He's talking about with actual Ethernet, I think.
gollark: What does the MAC address have to do with any of this?
gollark: https://yggdrasil-network.github.io/2018/07/17/world-tree.html
gollark: These things mostly just use links over the existing internet, since the few people who are interested mostly don't live near each other.
gollark: It's a mesh network thing. Unlike the normal hierarchical unternet, where people have a link with their ISP, who then connects to an internet exchange or something, mesh nets can have anyone peer with anyone and the routing is automatically worked out. Yggdrasil is quite like the more popular cjdns, but with a different routing algorithm based on a tree which may be more scaleable (it doesn't always return the shortest path, but uses less memory).
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.