areal　feature　main　skeleton　extraction　al gorithm

a　new　al gorithm　based 　the　delaunay　trian gulated　network　and 　its 　improved　al gorithm　isproposed 　to 　implement 　area 　feature 　automatic　skeleton 　line 　extraction．a　delaunay　trian gulated　network　al gorithm　was　improved 　to　be　better 　applied 　to　more　complex 　area 　feature 　of 　the 　trian gular 　network　establishmentthe 　existence　of 　a　lar ge　number　of 　smaller　trian gles 　in 　the 　facet 　element 　trian gulation 　boundary　re gion　was　carried　outan　effective 　processing　al gorithm　was　proposed 　to 　improve 　theskeleton　extraction　efficienc ytrian gle　was　considered 　the 　smallest　unit　as 　a　node　of 　the 　tree 　and　an　ef fective 　binar y　tree 　structure 　based　on　trian gulation　was　presentedtrifurcate 　chain－table 　stora ge　structure　was　used 　to　make　the　binar y　tree 　traversal 　more　strai ghtforward．the 　experimental 　resultsshowed 　that 　the　proposed　concepts 　and　al gorithms 　for　main　skeleton　extraction　to　be　more　effective．