1. Nonlinear Programming – Theory and Algorithms;Bazaraa,1993
2. A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph;Bhasker;Networks,1987
3. T. Biedl, B. Genc, Complexity of orthogonal and rectangular cartograms, in: Proc. 17th Canad. Conf. on Computational Geometry, 2005, pp. 117–120
4. De Grote Bosatlas,2001
5. On rectilinear duals for vertex-weighted plane graphs;de Berg,2005