• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.27 no.1
• /
• pp.657-666
• /
• 2009

In GIS area, many line simplification algorithms are studied among generalization methods used for making the building data in the form of digital map from the original line data. On the other hand, there are few studies on the simplification algorithm considering the drawing rules of the digital map in Korea. In this paper, the line simplification algorithm based on the drawing rules is proposed as the methodology to create or update the building data of digital map by extracting the building outline from the CAD data used in construction. To confirm the usefulness of the algorithm, this algorithm and four other effective and general line simplification algorithms (e.g., Douglas-Peucker algorithm) are applied to the same building outlines. Then, the five algorithms are compared on five criteria, the satisfaction degree of the drawing rules, shape similarity, the change rate of the number of points, total length of lines, and the area of polygon. As a result, the proposed algorithm shows the 100% of satisfaction degree to the drawing rules. Also, there is little loss in four other mentioned criteria. Thus, the proposed algorithm in this paper is judged to be effective in updating the building data in digital map with construction drawings.

• Journal of Navigation and Port Research
• /
• v.36 no.4
• /
• pp.285-290
• /
• 2012

e-Navigation strategy IMO promotes is defined as it is necessary for network and information standard to provide various maritime safety informations to in land and on board users, and it is expected to provide a large amount and diverse kinds of maritime spatial information services to them. However, as there are some limits to transmit that by current mobile maritime communication technologies, it is required to simplify and optimize the information. In this study, tree node method is applied to ENC using Douglas-Peucker algorithm and we arranged the effect of simplified spatial information through CALS method which compensates the defect of basic tree node method.

• Korean Journal of Remote Sensing
• /
• v.21 no.4
• /
• pp.329-339
• /
• 2005

In the mobile phone map service there are some restrictions of resolutions and process in terminals. So providing a sketch map is very efficient. This simplifies the map data and increases the understanding of the user. This sketched map marks the starting point and ending point. Then simplifies the surroundings like important roads or building so the user can find his/her way easily. First of all this sketch map service needs a method to simplify the route between starting point and ending point and the surroundings. After that it needs to make the simplified data into a sketch map and suitable to the terminal's resolution. To solve these problems this paper proposes a new method to manifest a sketch map efficiently through a mobile phone. The method, introduced in this paper, is surveyed to have a higher efficiency in data usage compared to the current services available in the market. And also it is examined to have a clear vision in process and easily understandable.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.819-826
• /
• 2002

The mobile vector map services for mobile devices, specially for PDA, are being popularized with the advent of KVM (Kilobytes Virtual Machine). However, the services for cellular phone have some problems for implementation, which are the restrictions of bandwidth, resource of the phone, etc. Thus, these restrictions force to develop new map database exclusively for cellular phone services. But, this approach needs high costs and could not support multi user view for a same area. Therefore, we suggest new client/server system for mobile vector map services, using existing general map database, and design and implement the system. The suggested system, which has minimized functions at client and processes map simplification works at sever, makes it possible to serve mobile vector map without developing new map database only for cellular phone.

• Journal of the Korean Mathematical Society
• /
• v.50 no.1
• /
• pp.61-80
• /
• 2013

In this paper, we study ${\alpha}$-completely positive maps between locally $C^*$-algebras. As a generalization of a completely positive map, an ${\alpha}$-completely positive map produces a Krein space with indefinite metric, which is useful for the study of massless or gauge fields. We construct a KSGNS type representation associated to an ${\alpha}$-completely positive map of a locally $C^*$-algebra on a Krein locally $C^*$-module. Using this construction, we establish the Radon-Nikod$\acute{y}$m type theorem for ${\alpha}$-completely positive maps on locally $C^*$-algebras. As an application, we study an extremal problem in the partially ordered cone of ${\alpha}$-completely positive maps on a locally $C^*$-algebra.

• Journal of the Korean Mathematical Society
• /
• v.36 no.1
• /
• pp.73-95
• /
• 1999

We prove that if a given complete Riemannian manifold is roughly isometric to a complete Riemannian manifold satisfying the volume doubling condition, the Poincar inequality and the finite covering condition at infinity on each end, then every positive harmonic function on the manifold is asymptotically constant at infinity on each end. This result is a direct generalization of those of Yau and of Li and Tam.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.951-962
• /
• 2013

We introduce semi-slant submersions from almost Hermitian manifolds onto Riemannian manifolds as a generalization of slant submersions, semi-invariant submersions, anti-invariant submersions, etc. We obtain characterizations, investigate the integrability of distributions and the geometry of foliations, etc. We also find a condition for such submersions to be harmonic. Moreover, we give lots of examples.

• Journal of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.165-175
• /
• 1998

We give a generalization of the selection theorem of Ben-El-Mechaiekh and Oudadess to complete LD-metric spaces with the aid of the notion of n-connectedness. Our new selection theorem is used to obtain new results of fixed points and coincidence points for compact lower semicontinuous set-valued maps with closed values consisting of D-sets in a complete LD-metric space.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.2
• /
• pp.445-449
• /
• 2021

We define the relative self-closeness number N��(g) of a map g : X → Y, which is a generalization of the self-closeness number N��(X) of a connected CW complex X defined by Choi and Lee [1]. Then we compare N��(p) with N��(X) for a fibration $X{\rightarrow}E{\rightarrow\limits^p}Y$. Furthermore we obtain its rationalized result.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.4
• /
• pp.831-841
• /
• 2009

For a map f : A $\rightarrow$ X, we define and study a concept of $G^f$-space for a map, which is a generalized one of a G-space. Any G-space is a $G^f$-space, but the converse does not hold. In fact, $S^2$ is a $G^{\eta}$-space, but not G-space. We show that X is a $G^f$-space if and only if $G_n$(A, f,X) = $\pi_n(X)$ for all n. It is clear that any $H^f$-space is a $G^f$-space and any $G^f$-space is a $W^f$-space. We can also obtain some results about $G^f$-spaces in Postnikov systems for spaces, which are generalization of Haslam's results about G-spaces.