IEEE Robotics & Automation Magazine - September 2014 - 80

[44] L. Paz, J. Neira, and J. Tardós, "Divide and conquer: EKF SLAM in O(n),"
IEEE Trans. Robot., vol. 24, no. 5, pp. 1107-1120, 2008.
[45] Natural Resources Canada. (2009). 100 years of geodetic surveys in Canada. [Online]. Available: http://www.geod.nrcan.gc.ca/timeline/timeline_e.php
[46] R. K. Burkard. (1983). Geodesy for the layman. U.S. Dept. Commerce,
Natl. Atmos. Administration, St. Louis, MO. [Online]. Available: http://www.
ngs.noaa.gov/PUBS_LIB/HARN_CORS_COMP/eval_harn_to_cors.html
[47] W. Ehrnsperger, "The ED87 adjustment," J. Geodesy, vol. 65, no. 1, pp.
28-43, 1991.
[48] K. O. Milbert. An evaluation of the high accuracy reference network relative to the continuously operating reference stations. National Geodetic Survey,
National Ocean Service, NOAA. [Online]. Available: http://www.ngs.noaa.gov/
PUBS_LIB/HARN_CORS_COMP/eval_harn_to_cors.html
[49] D. G. Pursell and M. Potterfield. (2008). NAD 83(NSRS2007) national readjustment final report. Natl. Ocean. Atmos. Administration, National Ocean Service. Silver Spring, MD. Tech. Rep. NOS NGS 60. [Online]. Available: http://www.
ngs.noaa.gov/PUBS_LIB/NSRS2007/NOAATRNOSNGS60.pdf
[50] H. Wolf, "Triangulation adjustment general discussion and new procedure," Bull. Géodésique, vol. 16, no. 1, pp. 87-104, 1950.
[51] J. D. Bossler, "Geodesy solves 900,000 equations simultaneously," Eos,
Trans. Amer. Geophys. Union, vol. 68, no. 23, pp. 569-569, 1987.
[52] Aeronautical Chart and Information Center, Preface and Part I: The Mathematical Theories, St. Louis, MO, 1964.
[53] B. Triggs, P. F. McLauchlan, R. I. Hartley, and A. W. Fitzgibbon, "Bundle
adjustment modern synthesis," in Vision Algorithms: Theory and Practice. Berlin Heidelberg, Germany: Springer-Verlag, 2000, pp. 298-372.
[54] H. Wolf, "The Helmert block method, its origin and development," in Proc.
2nd Int. Symp. Problems Related to the Redefinition of North American Geodetic
Networks, 1978, pp. 319-326.
[55] F. W. Hough, "The adjustment of the Central European triangulation network," Bull. Géodésique, vol. 7, no. 1, pp. 64-93, 1948.
[56] O. S. Adams, The Bowie Method of Triangulation Adjustment, as Applied to
the First-Order Net in the Western Part of the United States. Washington, D.C.:
U.S. Govt. Print. Office, 1930.
[57] H. Wolf, "Gaußscher algorithmus (Doolittle-Methode) und Boltzsches
Entwicklungsverfahren," Bull. Géodésique, vol. 26, no. 1, pp. 445-452, 1952.
[58] H. Boltz, Entwickelungs-Verfahren zum Ausgleichen Geodätischer Netze
nach der Methode der kleinsten Quadrate. Potsdam, Germany: Veröffendlichungen des Geodätischen Instituts Potsdam, 1923, no. 90.
[59] H. Boltz, Substitutions-Verfahren zum Ausgleichen grosser Dreiecksnetze in
einem Guss nach der Methode der kleinsten Quadrate. Potsdam, Germany:
Veröffendlichungen des Geodätischen Instituts Potsdam, 1938, no. 108.
[60] K. Kersting, "Lifted probabilistic inference," in Proc. 20th European Conf.
Artificial Intelligence, 2012, pp. 33-38.
[61] American Congress on Surveying, American Society for Photogrammetry and
Remote Sensing, and American Society of Civil Engineers, The Glossary of the
Mapping Sciences, American Society of Civil Engineers, Bethesda, MD, 1994.
[62] G. Bomford, "The readjustment of the Indian triangulation," Professional
Paper No. 28, Survey of India, Dehra Dun, 1939.
[63] G. Bomford, Geodesy. London, United Kingdom: Oxford Univ. Press, 1952.
[64] A. George, "Nested dissection of a regular finite element mesh," SIAM J.
Numer. Anal., vol. 10, no. 2, pp. 345-363, 1973.
[65] T. A. Davis, Direct Methods for Sparse Linear Systems, vol. 2. Philadelphia,
PA: Soc. Ind. Appl. Math., 2006.
[66] P. Agarwal and E. Olson, "Variable reordering strategies for SLAM," in
Proc. IEEE/RSJ Int. Conf. Intelligent Robots Systems, Oct. 2012, pp. 3844-3850.
[67] J. Avila and J. Tomlin, "Solution of very large least squares problems by nested
dissection on a parallel processor," in Proc. 12th Symp. Interface, 1979, pp. 9-14.

80

*

IEEE ROBOTICS & AUTOMATION MAGAZINE

*

september 2014

[68] G. H. Golub and R. J. Plemmons, "Large-scale geodetic least-squares
adjustment by dissection and orthogonal decomposition," Linear Algebra
Applicat., vol. 34, pp. 3-28, Dec. 1980.
[69] R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision,
2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 2004.
[70] Z. Zhang, "Parameter estimation techniques: A tutorial with application to
conic fitting," Image Vis. Comput. J., vol. 15, no. 1, pp. 59-76, 1997.
[71] R. Kümmerle, G. Grisetti, H. Strasdat, K. Konolige, and W. Burgard, "G2o:
A general framework for graph optimization," in Proc. IEEE Int. Conf. Robotics
Automation, 2011, pp. 3607-3613.
[72] P. Krauthausen, F. Dellaert, and A. Kipp, "Exploiting locality by nested dissection for square root smoothing and mapping," in Proc. Robotics: Science Systems, 2006, pp. 73-80.
[73] G. Grisetti, C. Stachniss, and W. Burgard, "Nonlinear constraint network
optimization for efficient map learning," IEEE Trans. Intell. Transport. Syst.,
vol. 10, no. 3, pp. 428-439, 2009.
[74] G. Grisetti, S. Grzonka, C. Stachniss, P. Pfaff, and W. Burgard, "Efficient
estimation of accurate maximum likelihood maps in 3D," in Proc. IEEE/RSJ Int.
Conf. Intelligent Robots Systems, 2007, pp. 3472-3478.
[75] G. Dubbelman, P. Hansen, B. Browning, and M. B. Dias, "Orientation only
loop-closing with closed-form trajectory bending," in Proc. IEEE Int. Conf.
Robotics Automation, 2012, pp. 815-821.
[76] T. Davis. (2006). Suitesparse. [Online]. Available: http://www.cise.ufl.edu/
research/sparse/SuiteSparse/
[77] Y. Chen, T. A. Davis, W. W. Hager, and S. Rajamanickam, "Algorithm 887:
CHOLMOD, supernodal sparse cholesky factorization and update/downdate,"
ACM Trans. Math. Softw., vol. 35, no. 3, pp. 22:1-22:14, 2008.
[78] F. Helmert, "Über die Wahrscheinlichkeit der Potenzsummen der
Beobachtungsfehler und über einige damit im Zusammenhang stehende Fragen," Zeitschrift für Mathematik und Physik, vol. 21, pp. 192-218, 1876.
[79] W. Kruskal, "Helmert's distribution," Amer. Math. Monthly, vol. 53, no. 8,
pp. 435-438, 1946.
[80] O. Sheynin, "Helmert's work in the theory of errors," Arch. History Exact
Sci., vol. 49, no. 1, pp. 73-104, 1995.
[81] F. Dellaert, J. Carlson, V. Ila, K. Ni, and C. E. Thorpe, "Subgraph-preconditioned conjugate gradients for large scale SLAM," in Proc. IEEE/RSJ Int. Conf.
Intelligent Robots Systems, 2010, pp. 2566-2571.
[82] P. Hliněnỳ and G. Salazar, "On the crossing number of almost planar
graphs," in Graph Drawing. Berlin Heidelberg, Germany: Springer-Verlag,
2007, pp. 162-173.

Pratik Agarwal, University of Freiburg, Institute of Computer Science, 79110 Freiburg, Germany. E-mail:
agarwal@informatik.unifreiburg.de.
Wolfram Burgard, University of Freiburg, Institute of
Computer Science, 79110 Freiburg, Germany. E-mail:
burgard@informatik.unifreiburg.de.
Cyrill Stachniss, University of Freiburg, Institute of Computer Science, 79110 Freiburg, Germany, and University
of Bonn, Institute of Geodesy and Geoinformation, 53115
Bonn, Germany. E-mail: cyrill.stachniss@igg.unibonn.de.
http://www.geod.nrcan.gc.ca/timeline/timeline_e.php http://www http://ngs.noaa.gov/PUBS_LIB/HARN_CORS_COMP/eval_harn_to_cors.html http://www.ngs.noaa.gov/ http://www http://ngs.noaa.gov/PUBS_LIB/NSRS2007/NOAATRNOSNGS60.pdf http://www.cise.ufl.edu/
Table of Contents for the Digital Edition of IEEE Robotics & Automation Magazine - September 2014
