In　this　paper,　a　new　method　for　airspace　sectorization　is　proposed　based　on　a　weighted　graph　spectral　bisection　algorithm.　An　undirected　graph　model　is　first　constructed,　which　accurately　represents　airports,　waypoints,　and　air　routes;　accordingly.　The　sectorization　problem　is　described　as　a　graph　partitioning　problem.　Then,　a　Voronoi　diagram　is　built　in　which　the　sites　represent　vertexes　of　the　graph,　workload　of　treated　cells　are　computed,　and　the　treated　Voronoi　diagram　is　g5956　abstraced　as　a　weighted　graph　that　is　divided　into　sub-graphs　based　on　the　algorithm.　The　Voronoi　cells　corresponding　to　the　vertexes　of　each　subgraph　are　combined　together　to　form　sectors.　Lastly,　the　algorithm　is　applied　to　sectorization　of　the　airspace　of　North　China.　The　results　show　that　the　sectors　computed　by　the　algorithm　satisfy　not　only　workload　balance　and　minimum　coordination　workload　constraints,　but　also　the　constraints　such　as　convexity,　connectivity,　and　minimum　distance.　The　performance　of　a　simulation　validates　the　feasibility　of　the　algorithm.　©　2012　American　Society　of　Civil　Engineering.