• Title/Summary/Keyword: Map Generalization

Search Result 98, Processing Time 0.028 seconds

A Note on the Fuzzy Linear Maps

  • Kim, Chang-Bum
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.4
    • /
    • pp.506-511
    • /
    • 2011
  • In this paper we investigate some situations in connection with two exact sequences of fuzzy linear maps. Also we obtain a generalization of the work [Theorem4] of Pan [5], and we study the analogies of The Four Lemma and The Five Lemma of homological algebra. Finally we obtain a special exact sequence.

PRETOPOLOGICAL CONVERGENCE QUOTIENT MAPS

  • Park, Sang-Ho
    • The Pure and Applied Mathematics
    • /
    • v.3 no.1
    • /
    • pp.33-40
    • /
    • 1996
  • A convergence structure defined by Kent [4] is a correspondence between the filters on a given set X and the subsets of X which specifies which filters converge to points of X. This concept is defined to include types of convergence which are more general than that defined by specifying a topology on X. Thus, a convergence structure may be regarded as a generalization of a topology. With a given convergence structure q on a set X, Kent [4] introduced associated convergence structures which are called a topological modification and a pretopological modification. (omitted)

  • PDF

CONFORMAL HEMI-SLANT SUBMERSION FROM KENMOTSU MANIFOLD

  • Mohammad Shuaib;Tanveer Fatima
    • Honam Mathematical Journal
    • /
    • v.45 no.2
    • /
    • pp.248-268
    • /
    • 2023
  • As a generalization of conformal semi-invariant submersion, conformal slant submersion and conformal semi-slant submersion, in this paper we study conformal hemi-slant submersion from Kenmotsu manifold onto a Riemannian manifold. The necessary and sufficient conditions for the integrability and totally geodesicness of distributions are discussed. Moreover, we have obtained sufficient condition for a conformal hemi-slant submersion to be a homothetic map. The condition for a total manifold of the submersion to be twisted product is studied, followed by other decomposition theorems.

A Spatial Data Mining System Extending Generalization based on Rulebase (규칙베이스 기반의 일반화를 확장한 공간 데이터 마이닝 시스템)

  • Choi, Seong-Min;Kim, Ung-Mo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.11
    • /
    • pp.2786-2796
    • /
    • 1998
  • Extraction of interesting and general knowledge from large spatial database is an important task in the development of geographical information system and knowledge-base systems. In this paper, we propose a spatial data mining system using generalization method; In this system, we extend an existing generalization mining and design a rulebase to support deriving new spatial knowledge. For this purpose, we propose an interleaved method which integrates spatial data dominated and nonspatial data dominated mining and construct a rulebase to extract topological relationship between spatial objects.

  • PDF

A Study on the Evaluation of Simplification Algorithms Based on Map Generalization (지도 일반화에 따른 단순화 알고리즘의 평가에 관한 연구)

  • Kim, Kam-Lae;Lee, Ho-Nam;Park, In-Hae
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.10 no.2
    • /
    • pp.63-71
    • /
    • 1992
  • The digital map database is often produced for multiple purposes, including mapping at multiple scales; it is increasingly rare that a base map is digitized for mapping at a single scale. The most important problems in process of line simplification in map generalization and multiple representation is that tolerance value selected for simplifying base map information must be modified as feature geometry varies within the digital file to ensure both accuracy and recognizability of graphic details on a generalized map. In this study, we explored various algorithms regarding to line simplication at many scales from a single digital file, and presents a rule by which to determine those scale at which line feature geometry might be expected to change in map representation. By applying two measured of displacement between a digitized line and its simplification, five algorithms have been evaluated. The results indicate that, of the five, the Douglas-Peucker routine produced less displacement between a line and its simplification. The research has proved to automating map simplification, incorporating numeric guidelines into digital environment about what magnitude and variation in geometric detail should be preserved as the digital data is simplified for representation at reduced map scales.

  • PDF

A Study on the Cartographic Generalization of Stream Networks by Rule-based Modelling (규칙기반 모델링에 의한 하계망 일반화에 관한 연구)

  • Kim Nam-Shin
    • Journal of the Korean Geographical Society
    • /
    • v.39 no.4
    • /
    • pp.633-642
    • /
    • 2004
  • This study tries to generalize the stream network by constructing rule-based modelling. A study on the map generalization tends to be concentrated on development of algorithms for modification of linear features and evaluations to the limited cartographic elements. Rule-based modelling can help to improve previous algorithms by application of generalization process with the results that analyzing mapping principles and spatial distribution patterns of geographical phenomena. Rule-based modelling can be applied to generalize various cartographic elements, and make an effective on multi-scaling mapping in the digital environments. In this research, nile-based modelling for stream network is composed of generalization rule, algorithm for centerline extraction and linear features. Before generalization, drainage pattern was analyzed by the connectivity with lake to minimize logical errors. As a result, 17 streams with centerline are extracted from 108 double-lined streams. Total length of stream networks is reduced as 17% in 1:25,000 scale, and as 29% in 1:50,000. Simoo algorithm, which is developed to generalize linear features, is compared to Douglas-Peucker(D-P) algorithm. D-P made linear features rough due to the increase of data point distance and widening of external angle. But in Simoo, linear features are smoothed with the decrease of scale.

The Advance of Object Join Technique for Digital Map Ver. 2.0 (수치지도 Ver. 2.0 대상물 연결기법 개선)

  • Park, Kyeong-Sik
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.25 no.4
    • /
    • pp.289-297
    • /
    • 2007
  • Normaly, the map generlization methode has been used for the making of small scale map using a large scale map. The object join methode is consumed of a lots of processing time and the manual process. The object Join technique used in the NGI based on the digital map ver. 1.0 have problems of poor Joining rate and a lots of processing time. This study has improved the object Join technique considering of the geometry and attribute information for the digital map ver. 2.0. Using improved technique increased joining rate of object and reduced the processing time.

Comparison and Evaluation of Vector and Raster Methods in Mobile Map Services (모바일 지도 서비스에서 벡터와 래스터 기법의 비교 평가)

  • 최진오
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.464-467
    • /
    • 2003
  • There are two approaches to construct mobile GIS, Vector and Raster methods, according to the map data transformation format from server to mobile client. Each method requires a different implementation architecture of server and client modules for mobile map services. And each have advantages and disadvantages at the different aspects. This thesis implements these two approaches, thus, compares the each merits, by experiments. They include the transmission performance, map quality, and so on.

  • PDF

Determination of N:M Corresponding Pairs between Block Polygon Sets from a Topographical Map and a Cadastral Map (지형도와 연속지적도의 가구계 폴리곤 집합간의 N:M 대응쌍 탐색)

  • Huh, Yong;Kim, Jung-Ok;Yu, Ki-Yun
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.3
    • /
    • pp.47-49
    • /
    • 2009
  • In this paper, we proposed a new algorithm for determination of many-to-many corresponding pairs between block-polygon sets from the national topographical map and the cadastral map in Korea Land Information System, caused by different abstraction and generalization rules of the two maps. Our proposed algorithm starts from an assumption that a block-polygon for a N:M pair should significantly overlap at least one block polygon of the counterpart group, and determines N:M pairs using an iterative updating and searching with this overlapping analysis. This iteration process is terminated when the N:M corresponding pairs satisfy our predefined 1:1 corresponding condition.

  • PDF