Sorting of Section Contour Data Based on Linear Quadtree
2012 ◽
Vol 215-216
◽
pp. 635-638
A method based on the linear quadtree is proposed to sort the discrete data of the section contour. Firstly the contour data are distributed to different nodes of the linear quadtree and the data in the same node are sorted. Then neighbor node search regulations are established to help sort data in different nodes counter-clockwise. Experiment shows that the presented method can sort the data effectively.
2007 ◽
Vol 44
(02)
◽
pp. 393-408
◽
Keyword(s):
2005 ◽
Vol 54
(1)
◽
pp. 127-142
◽
2012 ◽
Vol 12
(04)
◽
pp. 1250083
Keyword(s):
Keyword(s):
Keyword(s):
2001 ◽
Vol 23
(8)
◽
pp. 859-872
◽