Full text: XVIIth ISPRS Congress (Part B3)

  
N 
e could 
nnected 
ion 2.1) 
ent ver- 
1). 
1e of the 
: for bi- 
1es, etc. 
j) 
to each 
hm you 
nple for 
can be 
ls to do 
0 assign 
; known 
ne from 
orithms 
or directly from the human being in charge of the 
computation. 
If the complexity of the situation so requires or if 
one is trying to detect structural gross errors, the 
above procedure could be done even interactively. 
8 CONCLUSIONS AND OUTLOOK 
From Section 3, Section 4 and from [3] it seems pos- 
sible to set up a discrete model for the classical [least 
squares] adjustment of general networks. All the in- 
formation required for the model is contained in the 
hypergraph associated to the functional model design 
hypermatrix (block matrix). In particular, operations 
like formation of reduced normal equations, formation 
of nested dissection blocks and partial elimination of 
unknown groups can be formulated as pure [general- 
ized] numbering/elimination operations on graphs. 
It is quite clear that for some of the concepts 
and the results presented here to become practica- 
ble (recall Section 6.4) key problems are still to be 
solved; considerable research is still to be done both 
in the theoretical and applied sides. This is, there- 
fore, just an intermediate paper though some of its 
ideas have been already applied at the Institut Car- 
tografic de Catalunya in the development of the Geo- 
TeX system [4]. (More details, practical motivation 
and proofs to all statements made here can be found 
in [3].) 
Last but not least, it will be more than enough if 
the paper contributes to the growing feeling that tech- 
niques from discrete mathematics can be of help for 
a new generation of photogrammetric/geodetic proce- 
dures and software, even in the almost old-fashioned 
field of network adjustment. 
References 
[1] Berge,C.,1973. Graphs and hypergraphs. North- 
Holland, Amsterdam. 
[2] Bryant,V.,Perfect,H.,1980. Independence theory 
in combinatorics. Chapman and Hall, London 
and New York. 
[3] Colomina,l., 1991. Structural aspects of hy- 
brid networks in geodesy and photogrammetry. 
Ph.D. dissertation, Departament de Matematica 
Aplicada i Analisi, Universitat de Barcelona, 
Barcelona. 
[4] Colomina,l.,Navarro,J.A.,Térmens,A.,1992. 
GeoTeX: a general point determination system. 
In: International Archives of Photogrammetry, 
Vol. 29, Comm. III. 
621 
[5] 
[6] 
[7] 
[8 
——À 
[9] 
[16] 
[17] 
Dermanis,A.,1991. Integrated geodesy. Report of 
the IAG Special Study Group 1.73: period 1987- 
1991, XX General Assembly of the IUGG, Wien. 
Friedrich,K.,1930. Beitráge zur direkten und 
indirekten Auflósung der Normalgleichungen 
unter besonderer Berücksichtigung der geodà- 
tischen Netzausgleichung. Zeitschrift für Ver- 
messungswesen, 49: 525-539. 
Grafarend,E.W.,Mader,A.,1989. A  graph- 
theoretical algorithm for detecting configuration 
defects in triangular geodetic networks. Bulletin 
Géodesique, 63: 387—394. 
George, A.,Liu,J.W.H.,1978. An automatic nes- 
ted dissection algorithm for irregular finite el- 
ement problems. SIAM J. Numerical Analysis, 
15: 1053-1069. 
Hein,G.W.,1986. Integrated geodesy state-of- 
the-art 1986. Joint Workshop on Combined Ad- 
justment of Heterogeneous Geodetic and Pho- 
togrammetric data, IAG-ISPRS, München. 
Horton,J.D.,1987. A polynomial time algorithm 
to find the shortest cycle basis of a graph. SIAM 
J. Computation, 16: 358-366. 
Mark,A.,Poder,K.,1982. Ordering and dissection 
of geodetic least squares equations. Deutsche 
Geodätische Komission, Col. B, Vol. 258/VIII, 
pp. 100-112, München. 
Rose,J.D.,Tarjan,R.E.,Lueker,G.S.,1976.  Algo- 
rithmic aspects of vertex elimination on graphs. 
SIAM J. Computation, 5: 266—283. 
Schwarz,C.R.,1978. TRAV10 horizontal network 
adjustment program. NOAA Technical Memo- 
randum NOS NGS No. 12, US Department of 
Commerce, NOAA, NOS, Rockville. 
Snay,R.A.,1978. Solvability analysis of geodetic 
networks using logical geometry. NOAA Techni- 
cal Memorandum NOS NGS No. 14, US Depart- 
ment of Commerce, NOAA, NOS, Rockville. 
Snay,R.A.,1979. Reducing the profile of sparse 
symmetric matrices. NOAA Technical Memoran- 
dum NOS NGS No. 4, US Department of Com- 
merce, NOAA, NOS, Rockville. 
Yannakakis,M.,1981. Computing the fill-in is 
NP-complete. STAM J. Algebraic Discrete Meth- 
ods, 2: 77-79. 
Zenger,Ch.,1986. Trends in computer and soft- 
ware technology and the impact on combined 
adjustment. Joint Workshop on Combined Ad- 
justment of Heterogeneous Geodetic and Pho- 
togrammetric Data, IAG-ISPRS, München. 
 
	        
Waiting...

Note to user

Dear user,

In response to current developments in the web technology used by the Goobi viewer, the software no longer supports your browser.

Please use one of the following browsers to display this page correctly.

Thank you.