) 7 1 0 2 E I I A ( g n ir e e n i g n E l a ir t s u d n I d n a e c n e g il l e t n I l a i c if it r A n o e c n e r e f n o C l a n o it a n r e t n I d r 3 7 1 0 2
8 7 9 : N B S
I -1-60595- 05 -9 2
n
a
f
o
y
d
u
t
S
I
m
p
r
o
v
e
d
B
u
li
d
i
n
g
P
o
l
y
g
o
n
S
i
m
p
il
if
c
a
it
o
n
A
l
g
o
r
ti
h
m
g
n
e
h
C
-
m
i
n
g
L
i
*,
Y
o
n
g
Y
I
N
a
n
d
C
h
a
o
L
I
A
N
g n i p p a M d n a g n i y e v r u S f o y m e d a c A e s e n i h
C ,Beiijng,China r
o h t u a g n i d n o p s e r r o C *
: s d r o w y e
K F ro -u adjacent-pointmethod, BulidingPolygonSimpilifcaiton, NewMapWJ.
.t c a r t s b
A Aimingt oenhancet heefficiencyandaccuracyoft hesimplificationalgorithm,t hispaper r
u o f e h t n o d e s a b m h t i r o g l a n o i t a c i f i l p m i s n o g y l o p g n i d l i u b d e v o r p m i n a d e s o p o r
p -adjacent-poin t
l c x e s a w s t n i o p t n a d n u d e r f o e c n e r e f r e t n i e h T . d o h t e
m uded to avoid consuming operation ;the
c i s a b f o g n i s s e c o r p e h t g n i s s i m d i o v a o t d e n i f e r s a w t i n u g n i s s e c o r p c i s a b e h t f o n o i t a c i f i s s a l c
a e k a t n a c m h t i r o g l a e h t t a h t d e w o h s t l u s e r t n e m i r e p x E . e r u t c u r t s l a i c e p s a s a h h c i h w t i n u g n i s s e c o r p
y c n e i c i f f e r e t t e
b andaccuracy ,andi twasmorepractica.l
n o it c u d o r t n I
h c r a e s e r l a n o i t a n r e t n i e v i t a e r c d n a g n i g n e l l a h c t s o m e h t f o e n o s i n o i t a z i l a r e n e g p a m c i t a m o t u A
s i n a l p e h t h c i h w f o , p a m a n i s t n e m e l e t n a t r o p m i t s o m e h t f o e n o s i e c n e d i s e R . y h p a r g o t r a c n i s e l z z u p
m o
c plicatedandofspatia lstructureandi nvolvesrichsemantici nformation ,makingt heresearchon e
g r a l a n O . ] 2 , 1 [ g n i g n e l l a h c n a l p e c n e d i s e r f o n o i t a c i f i l p m i s c i t a m o t u
a -scale topographic map ,
s n o c d n a m o r f e c i o h c a e k a m o t s i n o i t a c i f i l p m i s n a l p e c n e d i s e
r olidatestreets ,summarizeinterna l
d e i f i l p m i s e b y a m t i , r e n n a m e l b a n o s a e r a n i d e s o p m o c e d e r a e s e h t f I . e n i l t u o y f i l p m i s d n a e r u t c u r t s
f o a e r a e h t f o t n e m g d u j h g u o r h t e c i o h c a g n i k a m y b , s i h t f o s m r e t n I . ] 3 [ s r o t a r e p o f o s e i r e s a h g u o r h t
e v a c n o
c -convexpartsi nacircumscribedrectangleorrectangulardifferencecombination ,Reference t
h g i r f o n o g y l o p g n i d l i u b e h t d e i f i l p m i s 6 o t
4 -angled turn ,yielding a good resul tof stree t
e g r a l a n o n o i t a c i f i l p m i
s -scalemap ;Reference7t o10firs tbuil tatriangulationnetworkforoveral l
e v a c n o c d e t a r e g g a x e r o d e t e l e d , d e l l i f n e h t d n a l o r t n o
c -convexparts ,whichr equiredt het riangulaiton
y l h g i h t i g n i k a m , e l g n a i r t h c a e f o l a s o p s i d d n a t n e m g d u j e h t d n a s t n i o p c i t s i r e t c a r a h c l l a f o
a o t n o i t a l e r n i d n a , d e t a c i l p m o
c complexpolygon ,anewstrategy wasrequired to avoid boundary
e h t d e i f i l p m i s 1 e c n e r e f e R , t r a p n i s t n i o p t n e c a j d a r u o f f o n o i t a c i f i l p m i s h g u o r h T . ] 7 [ n o i t c e s r e t n i
p m i d n a n o g y l o p e h t f o a e r a d n a s e r u t a e f e l i f o r p e h t d e n i a t n i a m h c i h w , n o g y l o p g n i d l i u b e l o h
w roved
g n i n r u t e s l a f d n a t n a d n u d e r e h t f o e s o p s i d o t d e l i a f t u b , t n e t x e n i a t r e c a o t y c n e i c i f f e n o i t a c i f i l p m i s e h t
d i l a v n i n i g n i t l u s e r s u h t , s i s a b d e i f i s s a l c a n o n o g y l o p g n i d l i u b e h t f o e s o p s i d r o k r a m o t d n a s t n i o p
p m i s e h t f o n o i s s i m o d n a n o i t a c i f i l p m i
s lificationofsomespecia lpolygons.
d e v o r p m i n a d e s o p o r p r e p a p e h t , s m h t i r o g l a e v o b a e h t n o h c r a e s e r f o s i s a b e h t n o , e s o p r u p e h t r o F
r u o f e h t n o d e s a b m h t i r o g l a n o i t a c i f i l p m i s n o g y l o p g n i d l i u
b -adjacent-poin tmethod to achievefas t
c i h w n i , n o i t a c i f i l p m i
s honlythesimplification ofbuildingpolygon intheeven toflarge-scalemap
d n a s t n e d i s e r f o e d a r g e h t n i e g n a h c e h t o t n e v i g s i n o i t a r e d i s n o c o n t u b d e v l o v n i s i n o i t a z i l a r e n e g
.. n o i t a d i l o s n o c t e e r t s
Ba iscDe ifniiton
h t , n o i s s u c s i d f o e c n e i n e v n o c e h t r o
F efollowingt ermsusedhereinhavet hefollowingdefinitions , as
n i n w o h
e r u g i
F 1. Redundan tPoin tandFalseTurningPoint.
o P t n a d n u d e
R i nt
s t n i o p t n e c a j d a e e r h t g n o m a o w t y n a g n i t c e n n o c y b d e m r o f s e n i l t h g i a r t s o w t n e e w t e b e l g n a e h t n e h W
, r a e n i l l o c d e r e d i s n o c e r a s t n i o p e e r h t e h t , e l g n a ) o r e z r o ( t h g i a r t s a s i n o g y l o p g n i d l i u b a f o e d i s a n o
e m o e g e h t n o t c e f f e o n s a h t n i o p e l d d i m e h t d n
a trica lshapeofthepolygons .Therefore ,themiddle
.t n i o p t n a d n u d e r a d e l l a c d n a t n a d n u d e r s i t n i o p
n o n d n a r o r r e n o i t i s i u q c a a t a d e h t o t e u d , y l r a l u c i t r a
P -standardcharting,t herearefewredundancy
t u O . p a m a n o n o g y l o p g n i d l i u b a f o e d i s e h t n o s t n i o
p oft heconsiderationoft her ationality ,givent he
e h t n e h w : t n i o p t n a d n u d e r f o n o i t i n i f e d e h t o t n o i s i v e r a e d a m r e p a p e h t , ° 5 s a w e l g n a r e p m u b
e e r h t g n o m a o w t y n a g n i t c e n n o c y b d e m r o f s e n i l t h g i a r t s o w t n e e w t e b e l g n a e h t n e e w t e b e c n e r e f f i d
t n i o p t n e c a j d
a sonasideofabuildingpolygonandastraight( orzero)anglei sl esst han5°,t hemiddle .t
n i o p t n a d n u d e r a d e l l a c s i t n i o p
t n i o P g n i n r u T e sl a F
o w t y n a g n i t c e n n o c y b d e m r o f s e n i l t h g i a r t s o w t n e e w t e b e l g n a e h t n e e w t e b e c n e r e f f i d e h t n e h W
d a e e r h t g n o m
a jacen tpointsonasideofabuildingpolygonandastraight( orzero)anglei smoret han y n a g n i t c e n n o c y b d e m r o f s e n i l t h g i a r t s e h t f o s e p o l s e h t f o s e u l a v e t u l o s b a e h t , ° 0 1 n a h t s s e l d n a ° 5
e l d d i m e h t , s i t a h t , e t a m i x o r p p a e r a s t n i o p e e r h t e h t g n o m a o w
t poin thardly affectsthe extension
. y l g n i d r o c c a t n i o p g n i n r u t e s l a f a d e l l a c s i d n a , d i a l e r a s t n i o p e e r h t e h t h c i h w n o e d i s e h t f o n o i t c e r i d
1 U e h
T -type basic processing uni tof the las tpoin tacting as a false turning poin tis called false 1
U -typebasicprocessingunit ;theU2-typebasicprocessinguni tofthefirs tpoin tactingasafalse 2
U e s l a f d e l l a c s i t n i o p g n i n r u
t -typebasicprocessingunit;t hefla tU-typebasicprocessinguni toft he
d e l l a c s i t n i o p g n i n r u t e s l a f a s a g n i t c a t n i o p t s a l r o t s r i
f falsefla tU-typebasicprocessinguni.t
r u o
F -adjacent-poin tMethod-basedBulidingPolygonSimpil ifca iton
s t i h t i w r a e n i l l o c t s o m l a s i t n i o p t n a d n u d e r a , e v o b a t n i o p t n a d n u d e r f o n o i t i n i f e d e h t o t g n i d r o c c A
o f s i e n i l t h g i a r t s a e c n i S . s t n i o p o w t t n e c a j d
a rmed subjec tto twopoints ,aredundan tpoin thardly
t n i o p t n a d n u d e r a f o t n e m e v l o v n i e h t , e r o f e r e h T . n o g y l o p g n i d l i u b s t i f o a e r a d n a e p a h s e h t s e c n e u l f n i
u b a g n i y f i l p m i s f o s s e c o r p e h t n i d e t e l e d y l t c e r i d e b y a m t I . n o i t a c i f i l p m i s d i l a v n i n i t l u s e r l l i
w ilding
. n o g y l o p
r u o f e h
T -adjacent-poin tmethod-based building polygon simplification is achieved in the basic r o ( e s i w k c o l c , t n i o p t r a t s e h t s i n o g y l o p a f o e d i s t s e g n o l e h t n o t n i o p d n e n a n e v i g : s w o l l o f s a t p e c n o c
t n i o p t n e c a j d a r u o f t c e l e s ) e s i w k c o l c i t n
a s to constitute a basic processing unit ,and based on the
x e v n o c s t i f o s e p y t e h t e g d u j , r o t a c i d n i l l a r e v o n a s a d l o h s e r h t h t g n e l e l b i s i v m u m i n i
m -concave
. r e n n a m t n e r e f f i d a n i m e h t f o e s o p s i d d n a e r u t c u r t s
s i d n i a m 3 g n i w o l l o f e h t s a h m h t i r o g l a e v o b a e h
T advantages:
. d e v l o v n i s i t n i o p g n i n r u t e s l a f a r o n t n i o p t n a d n u d e r a r e h t i e n t n e v e e h t n i d e s u y l n o s i t I ) 1 (
e h t , d e s o p s i d s i n o g y l o p e h t f o t n i o p g n i n r u t e s l a f e h t r o n t n i o p t n a d n u d e r e h t r e h t i e n t a h t d e d i v o r p
e h t k r a m o t e r u l i a f e h t d n a n o i t a c i f i l p m i s d i l a v n i n i t l u s e r l l i w t n i o p t n a d n u d e r e h t f o t n e m e v l o v n i
e s l a
f turning poin twil lmake i teasyto omi ttheseparatedisposa lofthebasicprocessing units of 1
U e s l a f e h t , m h t i r o g l a e v o b a e h t h t i W . s e r u t c u r t s l a i c e p
s -typebasicprocessinguni tof0123i nFigure
2 U e s l a f e h t , a
2 -type basic processing uni tof 3401 in Figure 2b and the false fla tU-type basic
n i 0 5 4 3 f o t i n u g n i s s e c o r
p Figure2cwassimplified into0A3 ,3A1 and30respectively ,whichwas
e b t o n d l u o h s t a h t s t n i o p e h t e c n i s d e c u d e r n o g y l o p e h t f o a e r a e h t t a h t n o s a e r e h t r o f e l b a n o s a e r n u
t e l e d e r e w d e t e l e
d e d.
e r u g i
F 2. Simplificationoft heBasicProcessingUnitsofSpecia lStructures.
n o i t a c i f i l p m i s f o s s e c o r p e h t s e b i r c s e d y l l a c i t e r o e h t y l n o t I ) 2
( ,with which i tis impossible to
n i d e v l o v n i e r a n o g y l o p g n i d l i u b a n i ) s t n i o p t n a d n u d e r e h t g n i d u l c x e ( s e d o n l l a t a h t e r u s n e
U a n e h w , 1 e c n e r e f e R f o 4 e l u R o t g n i d r o c c A . n o i t a c i f i l p m i
s -typebasicprocessinguniti si nvolved
e h t , d e t c u d n o c s i n o i t e l e d d n
a firspoin tQoft henex tbasicprocessinguniti si mmediatelyfollowed
r o f d e s u s i m h ti r o g l a e v o b a e h t n e h w e l b a l i a v a s i k r a m o n n e v i G . t i n u t n e r r u c e h t f o P t n i o p t s r i f e h t y b
d n a P f o t n i o p t s r i f e h t f o t n e v e e h t n i n o g y l o p g n i d l i u b a f o n o i t a c i f i l p m i
s thelas tpoin tofQ ,the
e h t h c i h w f o t i n u g n i s s e c o r p c i s a b e h t f o n o i t a c i f i l p m i s e h t f o n o i t e l p m o c n o p u s d n e n o i t a c i f i l p m i s
, n o i t a c i f i l p m i s e h t n i d e v l o v n i n e e b t o n e v a h n o g y l o p e h t f o s e d o n r e h t o , e s a c h c u s n I . Q s i t n i o p t s r i f
s i t a s n u t l u s e r e h t g n i v a e
l factory .As shown in Figure 3 ,the polygon made up of points 0-10 is
e h t n i d e v l o v n i e r a 0 1 d n a 3 , 2 , 1 , 0 s t n i o p y l n o h c i h w g n o m a , m h t i r o g l a e v o b a e h t h t i w d e i f i l p m i s
o t g n i d r o c c A . a e r a d e d a h s e h t s a n w o h s t l u s e r e h t g n i n i a t b o , n o i t a c i f i l p m i
s Figure3 ,thepolygonis
. e l b a n o s a e r n u s i t l u s e r e h t o s , t n e t x e t s e t a e r g e h t o t d e i f i l p m i s t o n
e r u g i
F 3. SimplificationofPar tPoints.
f s r e d i s n o c y l n o t I ) 3
( ouradjacen tpointsinpart ,bu tneglectstheeven tofthewhole .Shouldthe
n o i t a c i f i l p m i s e h t , m h t i r o g l a e v o b a e h t h t i w n o i t a c i f i l p m i s f o s s e c o r p e h t n i d e r e d i s n o c t o n s i e l o h w
a t a h t d e d i v o r p , y r o t c a f s i t a s n u e b l l i w t l u s e r e h t d n a e c u d e r l l i w y c n e i c i f f
e complicatedandi mproper
f o e r a u q s e h t n a h t s s e l a e r a e h t f o r o , s e d o n 4 h t i w ( s n o g y l o p l a i c e p s e m o s o t e u d d e t p o d a s i m h t i r o g l a
. ) d l o h s e r h t e h t n a h t r e t r o h s e d i s h c a e d n a d l o h s e r h t
d e v o r p m
I BulidingPolygonSimpilifca itonAlgortihmBasedonFo Aur djacent Points
s t n i o p t n e c a j d a r u o f e v o b a e h t n o h c r a e s e r f o s i s a b e h t n
O -based building polygon simplification
: s t n e m e v o r p m i g n i w o l l o f e h t e d a m r e p a p e h t , s e g a t n a v d a s i d s t i e t a n i m i l e o t , m h t i r o g l
a ①deleting
; s t n i o p g n i n r u t e s l a f g n i k r a m d n a s t n i o p t n a d n u d e
r ② markingbuilding polygonsinrea ltime ;③
a e d I c is a B
①Judgeandmarkt her edundan tandf alset urningpointsamongt hese tofnodesofaknownbuilding n
a d n u d e r f o s t e s e h t o t n i m e h t e d u l c n i d n a , n o g y l o
p tpointsandfalsenodesrespectively ,andexclude
; s e d o n f o t e s e h t m o r f s t n i o p t n a d n u d e r e h
t ②Takeanendpoin tont hel onges tsideoft hepolygonas
; ) s t n i o p t n a d n u d e r g n i d u l c x e ( s e d o n e h t t r o s ) e s i w k c o l c i t n a r o ( e s i w k c o l c , t n i o p t r a t s e h
t ③Dispose
f
o thebuildingpolygononaclassifiedbasis ;④Fromt hefirs telementi nt hese tofnodes,t aket he ;
e p y t e r u t c u r t s s t i e g d u j d n a , t i n u g n i s s e c o r p c i s a b a s a s t n i o p r u o f f o n o i t a n i b m o
c ⑤ cA cordingto
r u t c u r t s e h t d n a n o g y l o p g n i d l i u b t n e r r u c e h t f o e p y t e h
t eoft hecurren tbasicprocessingunit ,simpilfy
d e k r a m e b d l u o h s s i t i h c i h w g n i r u d , n o g y l o p g n i d l i u b e h
t inrealt imeunti lmarkedast rue ,andend
t e s e h t n i t n e m e l e t s a l e h t s e m o c e b t i n u g n i s s e c o r p c i s a b e h t f o t n i o p t s r i f e h t n e h w n o i t a c i f i l p m i s e h t
ofnodes.
s t n i o P g n i n r u T e sl a F d n a t n a d n u d e R f o t n e m g d u J
t n a d n u d e r f o t e s e h t n i d e d u l c n i d n a , n o i t i n i f e d e v o b a e h t o t g n i d r o c c a d e g d u j s i t n i o p t n a d n u d e r A
g n i d r o c c a s t n i o p g n i n r u t e s l a f e g d u j o t , y l d e t a c i l p m o C . s t n i o p g n i n r u t e s l a f f o t n e m g d u j r o f s t n i o
p to
. s e d o n f o t e s e h t m o r f d e v o m e r t s r i f e b t s u m s t n i o p t n a d n u d e r , n o i t i n i f e d e h t
f o t n e m g d u
J theStructureo fa Ba iscProces isngUnti
d n a n o i t i n i f e d “ e h t o t g n i d r o c c a , t s r i f : t i n u g n i s s e c o r p c i s a b a f o e r u t c u r t s e h t g n i g d u j f o s s e c o r P
e h t f o n o i t a c i f i t n e d
i structureoft hecombinationoff ouradjacen tpoints” ,dividet hestructureofbasic , n e h t ; s e p y t U t a l f d n a 2 U , 1 U s e d u l c n i e p y t U h c i h w f o , e p y t U d n a e p y t Z o t n i t i n u g n i s s e c o r p
e s l a f f o s n o i t i n i f e d e h t d n a s t n i o p g n i n r u t e s l a f f o t e s e h t o t g n i d r o c c
a U1 ,U2and fla tU-typebasic
U t a l f d n a 2 U , 1 U m o r f s t i n u h c u s e t a r a p e s , s t i n u g n i s s e c o r
p -typebasicprocessingunitsrespectively.
s n o g y l o P g n i d li u B f o n o it a c if is s a l C
h t o t s r e f e r S ; s e d o n f o r e b m u n e h t o t s r e f e r N n e v i g , n o g y l o p g n i d l i u b a o t n o i t a l e r n
I earea ;L {L1 ,L2
…
… ,Ln} referst ot hese tofsides ;LminreferstotheminimuminL(.ie .thelengthoftheshortes t l
e h t . e .i ( L n i m u m i x a m e h t o t s r e f e r x a m L ; ) e d i
s engthoft hel onges tside) ;Svreferst ot heminimum
. d l o h s e r h t h t g n e l e l b i s i v
r a e r e h
T et wodifferentt ypesofbuildingpolygon:
r u o f a d e l l a c s i t i , 4 = N n e h w : n o g y l o p g n i d l i u b a f o s e d o n f o r e b m u n e h t o t t c e j b u S )
1 -poin t
. n o g y l o p l a r e n e g a d e l l a c s i t i , e s i w r e h t o ; n o g y l o p
e r h t h t g n e l e l b i s i v m u m i n i m d n a a e r a , h t g n e l e d i s e h t o t t c e j b u S )
2 shold of abuilding polygon :
e p y t a d e l l a c s i t i , v S < x a m L d n a , 2 v S < S n e h
w -Ipolygon ;whenS>Sv2 ,andLmax<Sv,i ti scalled
e p y t
a -IIpolygon ;whenS>Sv2 ,andLmin>Sv ,i tiscalledatype-IIIpolygon ;inothercases ,i tis e
p y t a d e l l a
c -IVpolygo n.
f o g n i k r a
M BulidingPolygons
e h t h t i w e c n a d r o c c a n i e m i t l a e r n i d e k r a m s i t i , n o g y l o p g n i d l i u b a f o n o i t a c i f i l p m i s f o s s e c o r p e h t n I
Q d n a t i n u g n i s s e c o r p c i s a b t n e r r u c e h t f o t n i o p t s r i f e h t s a s e d o n f o t e s e h t n i P n e e w t e b p i h s n o i t a l e r
f o t e s e h t n
i nodesast hefirs tpoin toft henex tbasicprocessingunit :whenP=Q,i ti smarkedas0 ; s
a d e k r a m s i t i , s e s a c r e h t o n i ; 1 s a d e k r a m s i t i , 1 + P = Q n e h
w - .1
Experiment
r u o f e h t n o t n e m i r e p x e n a e d a m r e p a p e h
T -adjacent-poin tmethod and theimprovedalgorithmand
. y c n e i c i f f e e m i t d n a y c a r u c c a e h t n i o w t e h t n e e w t e b n o s i r a p m o c a e d a m
n o si r a p m o C y c a r u c c A
e h t h t i w s n o g y l o p g n i d l i u b 6 0 8 1 d e t c e l e s e h t f o n o i t a c i f i l p m i s e h t n o e d a m s i t n e m i r e p x E
r u o
n i n w o h s s n o g y l o p g n i d l i u b l a c i p y t f o p u o r g a s i e r e h T . t n e r e f f i d e r a d e n i a t b o s t l u s e r e h t f o % 5 1 t u o b a
e r u g i
F 4 .Accordingt oFigure4,t hroughsimplificationoft hepolygons1 ,5 ,6 ,7 ,8 ,17 ,18 ,19 ,20 ,21 , 4
2 d n a 3 2 , 2
2 witht het woalgorithms ,differentr esultsareobtained ,amongwhichpolygons1 ,5 ,6 ,7 , r
u o f e h t h t i w d e i f i l p m i s y l d r a h e r a 1 2 d n a
8 -adjacent-poin tmethod bu twholly simplifiedwith the
i l p m i s s i 4 2 d n a 2 2 , 0 2 , 8 1 , 7 1 s n o g y l o p f o h c a e ; m h t i r o g l a d e v o r p m
i fiedi ntoal inealmos twitht he
r u o
f -adjacent-poin tmethod ,bu tdeletedwitht hei mprovedalgorithmf ort her easont ha ttissidel ength a e r a e h t f o o i t a r e h t . e .i ( d l o h s e r h t e h t f o e r a u q s e h t n a h t s s e l s i a e r a e h t d n a d l o h s e r h t e h t n a h t s s e l s i
m u s e h t o
t oft heareai nt hewholel ayeri ssuchl owt hati ti snegligible) ;witht hei mprovedalgortihm , n
e e w t e b n o s i r a p m o c h g u o r h t d n a , y l e t a r a p e s d e i f i l p m i s e r a 3 2 d n a 9 1 s n o g y l o
p Figure4bandFigure
c e r o m s i m h t i r o g l a d e v o r p m i e h t h t i w d e n i a t b o t l u s e r e h t , c
4 omplian twith theoriginal .Therefore ,
. e t a r u c c a e r o m s i n o i t a c i f i l p m i s e h t , d e s o p o r p m h t i r o g l a d e v o r p m i e h t h t i w
e h T ) a
( origina ldata )( Tb hefour-adjacent-poin tmethod (c)Thei mprovedalgorithm e
r u g i
F 4. AccuracyComparison.
n o si r a p m o C y c n e i c if f E
r u o f e h t n o s t n e m i r e p x e e h
T -adjacent-poin tmethodandt hei mprovedalgorithmaremadet hroughan
m o o r e h t r e d n u p o t p a l o v o n e L d e s a b 6 8 X I P C
A temperatureof25°C .Acomparisoni smadebetween
e h t f o r e b m u n e h t o t s r e f e r N h c i h w n i , I e l b a T n i n w o h s s a y c n e i c i f f e e m i t n i s m h t i r o g l a o w t e h t
h t g n e l e l b i s i v m u m i n i m e h t o t s r e f e r v S ; e l a c s a o t s r e f e r e l a c S ; s n o g y l o p g n i d l i u b d e i f i l p m i s
1 T ; d l o h s e r h
t referst ot het imet akent osimplifyt hepolygonswitht hefour-adjacent-poin tmethod ; .
m h t i r o g l a d e v o r p m i e h t h t i w s n o g y l o p e h t y f i l p m i s o t n e k a t e m i t e h t o t s r e f e r 2 T
e l b a
T 1 .Comparisoni nTimeEfficiency.
N Scale Sv/m T1/s T2/s 2
2
5 1:15000 4 .5 2.833 1.752 8
0 3
1 8.279 5.799
6 0 8
1 11.252 8.425
s u o e g a t n a v d a s i m h ti r o g l a d e v o r p m i e h t , n o it a c i f i r e v l a c it c a r p d n a n o s i r a p m o c e v o b a e h t h g u o r h T
r u o f e h t r e v
o -adjacent-poin tmethodi nefficiencyandaccuracy.
Conclu ison
n i d l i u b d e v o r p m i n a d e s o p o r p r e p a p e h
T g polygon simplification algorithm based on the
r u o
f -adjacent-poin tmethod ,whichmayi mprove:①theefficiencyofsimplification ;② ht eaccuracy t l u s e r e h t h c i h w h t i w , g n i m m a r g o r p h g u o r h t d e z i l a e r s i m h t i r o g l a d e v o r p m i e h T . n o i t a c i f i l p m i s f o
g n i e b d e n i a t b
o displayedonNewMapWJandvariousbuildingpolygonsmaybesimplified .Through
e b o t d e v o r p s i m h t i r o g l a d e v o r p m i e h t , s t l u s e r e h t n o n o i t a u l a v e d n a n o i t a c i f i r e v , n o s i r a p m o c
r u o f e h t r e v o s u o e g a t n a v d
s e c n e r e f e R
] 1
[ Wenshua iX.U. ,Y iL. ,Tong Z. ,e tal .Simplification of Building Polygon Based on Adjacen t r
u o
F -Poin tMethod .ActaGeodaeticaE tCartographicaSinica ,(2013) ,42(6): 99 - 62 9 . 3
[2] Wang H.L., Fang W.U. ,Zhang L.L. ,e ta.l The Application of Mathematica lMorphology and , a c i n i S c i h p a r g o t r a C t E a c i t e a d o e G a t c A . n o i t a c i f i l p m i S n o g y l o P g n i d l i u B o t n o i t i n g o c e R n r e t t a P
(2005) ,34(3): 92 - 66 2 . 7
[3] Wang L. ,Yong-Shu L.I. ,Center G.E. ,e tal .Research of web map in automatic mapping of d
n a m e d n o d e s a b s c i t s i r u e
h -oriented .EngineeringofSurveyingandMapping ,(2014),23(1): 13 - .3 4
[4] GuoQingsheng ,MaoJianhua.Themethodofgraphicsimplificationofareaf eatureboundarywtih s
e l g n a t h g i
r . G oe -Spatia lInformationScience,(2000),3(2): 47 - .7 8
[5] Guo R. ,Tinghua A.I .Simplification and Aggregation of Building Polygon in Automatic Map h
u W f o l a n r u o J . n o i t a z i l a r e n e
G an Technica lUniversity of Surveying & Mapping ,(2000) ,25(1):
5 2 - .3 0
[6] Bayer ,Tomas .AutomatedBuildingSimplificationUsingaRecursiveApproach. Cartographyi n .
e p o r u E n r e t s a E d n a l a r t n e
C (2010), 11 - 62 1 4
[7] A iT.H. ,GuoR.Z. ,Chen X. .D Simplification and aggregation ofpolygon objec tsupported by s
c i h p a r G & e g a m I f o l a n r u o J . e r u t c u r t s n o i t a l u g n a i r t y a n u a l e
D , (2001), 6(7): 37 -0 709.
[8] ZhangJ. ,ZhouY., LiuY. AnImprovedAlgorithmforSDSMode lBasedPolygonSimplification e
g a m I f o l a n r u o J . n o i t a g e r g g A d n
a &Graphics ,(2006),11(7):1010-1016.
[9] Qian H.Z. ,Fang W.U. ,Zhu K..P ,e tal .A Generalization Method of Stree tBlock Based on n
o i s n e m i
D -reducingTechnique .ActaGeodaeticaE tCartographicaSinica,(2007), 36(1): 21 -0 107. 1
[ 0] Chen W. ,Y iL. ,Jie S. ,e ta.l Structure Recognition and Progressive Simplification of the D
d e n i a r t s n o C n o d e s a B n o g y l o P g n i d l i u B f o s e v a c n o
C -TIN .Geomatics& Information Scienceof
, y t i s r e v i n U n a h u