2011 Fourth International Conference on Intelligent Computation Technology and Automation

Solution for TIN Creating from Contour for Digital-Agriculture Using Based on
Recursive Thought

ķĸĺ ķ ķ Ĺ ĺ ĸ
WEN Min , TANG Xin-ming , SHI Shao-yu , WEN Jian-qiang ,YAN Hao-wen , Ouyang Sida
ķSatellite Surveying and Mapping Application Center,SBSM Beijing, China
ĸChinese Academy of Surveying and Mapping Beijing, China
ĹGuangzhou Railway Group Corporation Yiyang, China ĺLanzhou Jiaotong University Lanzhou, China
E-mail: htshah@126.com

Abstract—TIN date is wildly used in digital-agriculture area, corresponding flat-triangle-solving solution according to the
but there is a drawback in TIN creating from Contour, specific situation.
especially in agriculture-application, that is flat-triangle. Some
researchers have study on this and a lot algorithm have been TIN for processing
brought out, in this paper, a improved algorithm of solving the
problem about flat-triangle is proposed base on recursive Recursive
thought. This algorithm is used in the 863-project of Nation, Process Searching for flat-triangle
have been proved that is more simply and effective than other
but can get a satisfactory result. Have not
Keywords- TIN, Contour, flat-triangle, digital-agriculture Extend to Extend to
Extending
the flat-triangle the
I. INTRODUCTION boundary boundary
Digital-Agriculture is developed very fast in these years.
Effective geo-data is essential for the application, especially
the DEM-data, it is wildly used in agriculture location, Proc ĉ.Two Proc Ċ.None Proc ċ.One
irrigation, construction of agriculture-facility, agriculture flat-triangles flat-triangle flat-triangle
decision, normal management and so on. But the TIN data around the around the around the
created from contour has a defect that it has many “flat- active triangle active triangle active triangle
triangle” in it, and this is more serious and it must been
solved in the agriculture application.
Some algorithms are existed [1~5]. In the paper of
Christopher Gold [6], a method has been brought out, that is
generation of ridge and valley lines via Delaunay Flat-triangle-solving solution
triangulation and Voronoi diagram, extracting the skeleton of
the contour. Finally, algorithm solves the flat triangles based Figure 1. Main idea of the igorithm.
on all these information. The result of this algorithm is the
most satisfactory in the flat-triangle-solve algorithms, but it
is not easy to understand and implement; CHEN Renxi A. Search for flat-triangle
developed a method [7] ,which using medial axes to solve the
B. Recursive extend flat-triangle
common flat triangle, solving the special circumstances such
as the flat triangles in the mountain top, saddle, valley (ridge) C. Flat-tringle-solving solution [9,10]
adjacent to frame, it divides the problem into too many
situations that is hard to program it, and the tin which created 1) Two flat-triangles around the active triangle: As
by is too crushed; The method of DI Yuan from Peking Proc ĉ in Figure 1. As the Figure 2 showing, algorithm
University use interpretation to solve the flat-triangle, but it extends from triangle A to B, and the other two triangles
needs the intervention of users[8]; According to the discuss around triange B (triangle C and triangle D in the figure) is
above, Interpretation is the key way to solve the problem, but both the flat-triangles, in this situation, use the Sing-Point-
a improved algorithm that is not only more easy-understand Insert solution, that is inserting a single point in every flat-
and implement but also effective is very needed, especially triangle, as point 4 in triangle C, this point is come out by
for the digital-agriculture area.
Equation (1):
II. IMPROVED ALGORITHM 4.x=(1.x+2.x+3.x)/3
4.y=(1.y+2.y+3.y)/3 (1)
Improved algorithm this paper proposed runs after TIN-
4.z=(1.z+2.z+3.z)/3
Construction. The main idea just like Figure 1 showing, it
mainly contains a recursive process to extend the flat-triangle
till the boundary of the flat-triangle block, and then call the

978-0-7695-4353-6/11 $26.00 © 2011 IEEE 197

182
DOI 10.1109/ICICTA.2011.336

Figure 2. Skech map of the two flat-triangles-solving.
2) None flat-triangle around the active triangle: As
Proc Ċ in Figure 1:
a) Active triangle has one or more edges is the
boundary of the tin:As Figure 3 showing, tirangle B is the
active triangle, and its edges except the one share with
triangle A are the boundaies of the TIN, In situation,Single-
Point-Insert solution used, and it is the same as the
description in step (1).
Figure 3. Skech map of the none flat-triangles-solving (Boundary).
b) Active triangle has no edge is the boundary of the
tin: there are two situations in this step.
ƽ The shape of polygon conposed by active
triangle and the no-flat-triangle is convex.As Figure 4
showing, in this situation, Change-Diagonal solution must
be taken in, change the diagonal of the polygon composed
by flat-triangle B and no-flat-triangle C.
Skech map of the none flat-triangles-solving (convex)
ƽ The shape of polygon conposed by active
triangle and the no-flat-triangle is concavo.As Figure 5
showing, in this situation, use the Double-Triangle-Insert
solution,that is add a point between flat-triangle B and no-
flat-triagnle D, and this point is the middle point of shared
edge of these triangles.
183
198
1.x=(2.x+3.x)/2
1.y=(2.y+3.y)/2 (2)
1.z=(2.z+3.z)/2
Figure 4. Skech map of the none flat-triangles-solving (concavo).
3) One flat-triangle around the active triangle: As Proc
ċ in Figure 1:
a) Active triangle has one edge is the boundary of the
tin: As Figure 5 showing, one of the active triangle C is the
boundary of the TIN, and triangle C is flat-triangle too,
Sing-Point-Insert solution used in this situation. And
solution is the same with step (1).
Figure 5. Skech map of the one flat-triangles-solving (boundary).
b) Active triangle has no edge is the boundary of the
tin: there are two situations in this step.
ƽ The shape of polygon conposed by active
triangle and the no-flat-triangle is convex.As Figure 6
showing, in this situation, Change-Diagonal solution must
be taken in as the step (2)-b-1 doing.
Figure 6. Skech map of the one flat-triangles-solving (convex).
ƽ The shape of polygon conposed by active triangle and
the no-flat-triangle is concavo.As Figure 7 showing, in this
situation, use the Double-Triangle-Insert solution,that is the
same with step (2)-b-2 doing.

Figure 7. Skech map of the one flat-triangles-solving (concavo).
D. Data back.
III. EXPERIMENT
Experiment uses the contour data of a farm in eastern
China, the TIN created by raw algorithm is showed as Figure
8, lots of flat-triangle in the TIN data, and this area is not flat
in the real place, this mistake will make wrong decision in
digital agriculture application;
Figure 9 is the result of the improved algorithm, there are
no flat triangles there, TIN data is more accurate and the time
cost is under control.
Figure 8. Result of the TIN created from contour by raw algorithm.
Figure 9. Result of the TIN created from contour by improved algorithm.
184
199
IV. CONCLUSION
For the particularity of the use in digital-agriculture area,
this paper has proposed a improved algorithm. The improved
algorithm in this paper is based on recursive thought, more
simple and easy-implement then other algorithm for this, but
it is effective too, it has been used in the 863-project and this
paper uses detailed experiment to prove the result of the
algorithm. But it has lots of work to do, for example, the
processing in the point-extracting from the contour, this step
effects the result too; Improved Algorithm does not solve the
problem that edge of tin across the contour line; Some new
solution which combine the advantages of contour-skeleton
method and the method in this paper. All of these jobs must
be done in the future research.
REFERENCES
[1] Anton, F.; Gold, C.M. and Mioc, D., 1998, Local coordinates and
interpolation in a Voronoi diagram for a set of points and line
segments. Proceedings, 2nd Voronoi Conference on Analytic Number
Theory and Space Tillings; Kiev, Ukraine, pp. 9-12. J. Clerk Maxwell,
A Treatise on Electricity and Magnetism, 3rd ed., vol. 2. Oxford:
Clarendon, 1892, pp.68–73.
[2] Watson, D.F. and Philip, G.M., 1987, Neighborhood-
basedinterpolation, Geobyte, 2(2), 12-16.
[3] FOWLER, R. J㧘and LITTLE, J. J., 1999, Automated extraction of
irregular network digital terrain models. Computer Graphics, 13, 199-
207.
[4] Michael B. Gousie, CONTOURS TO DIGITAL ELEVATION
MODELS: GRID ৻ BASED SURFACE RECONSTRUCTION
METHODS. New York:Faculty of Rensselaer Polytechnic
Institute.1998
[5] JAY LEE, Comparison of network models existing methods for
building triangular irregular of terrain from grid digital elevation
models. INT. J. GEOGRAPHICAL INFORMATION SYSTEMS,
1991, VOL. S, NO. 3, 267-285
[6] Christopher Gold and Maciej Dakowicz, “Terrain Modelling from
Contours,” ??
[7] CHEN Renxi, LONG Yi. An Algorithm for TIN Generation
Considering Triangle Disposing. Geomatics and Information Science
of Wuhan University. Oct. 2003:619-622
[8] DI Yuan, A Corrective Method of Flat Region Occurring in DTM
Constructed from Contours.Journal of computer aided design aand
computer graphic. Aug.2000:566-570
[9] ZHANG Li-chao, ZHENG Hai-ying. Flat Triangles Correct
Algorithm to Create TIN Based on Contours.Journal of Zhengzhou
Institute of Surveying and Mapping. Dec.2006:432-435
[10] CHEN Xue-gong, HUANG Jing-jing.Corrective algorithm of flat
areas occourring inTIN constucted from contours.Computer
Applictions. July 2007:1644-1647