The constrained computing and application for intelligent generalization of settlements

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With the expanding and further development of GIS application, automated mapping has attracted wide attention both in multi-scale expression of spatial data and map automation production. Basing on least squares parameter estimation, we do much intensive research on constrained models and algorithms in generalization of settlements. This paper perfects the constrained conditions for intelligence generalization of building groups and establishes least squares algorithm models for simplification, exaggeration, collapse, merging and displacement of buildings. We realize the generalization of settlement through the constrained solving of building groups all at once. The available and correction of generalization result has been proved through MATLAB programming. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Wang, L., & Zhang, J. (2011). The constrained computing and application for intelligent generalization of settlements. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6987 LNCS, pp. 242–250). https://doi.org/10.1007/978-3-642-23971-7_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free