• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2009.04a
• /
• pp.29-34
• /
• 2009

Map update is required to provide up-to-date information. In update process, the most adequate generalization is to be applied to all scales of maps simultaneously. Most of existing maps are composed of 2D data and represented in 2D space. However, maps for next generation are to be generated with 3D spatial information including ortho-images and DEMs. Therefore, 3D generalization is necessary for 3D digital map update. This paper proposes methods for 3D generalization and correction for logical errors possibly accompanied with generalization.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.367-376
• /
• 2001

For the electronic map service by wireless, the existing map database cannot be used directly. This is because, the data volume of a map is too big to transfer by wireless and although the map is transferred successfully, the devices to display the map usually don’t have enough resources as the ones for desktop computers. It is also not acceptable to construct map database for the exclusive use of wireless service because of the vast cost. We propose new technique to generate a map for wireless service dynamically, from the existing map database. This technique includes the generalization method to reduce the map data volume and filtering method to guarantee that the data volume don’t exceed the limit of bandwidth. The generalization is performed in 3 steps :ㅁ step of merging the layers, a step of reducing the size of spatial objects, and a step of processing user interface. The filtering is performed by 2 module, counter and selector module. The counter module checks whether the data blume of generated map by generalization, exceeds the bandwidth limit. The selector module eliminates the excess objects and selects the rest, on the basis of distance.

• Journal of the Korean association of regional geographers
• /
• v.15 no.2
• /
• pp.307-315
• /
• 2009

The purpose of map generalization is a method of map making to transmit the concise cartographic representation and geographic meaning. New generalization algorithm has been developed to be applied in the digital environments by the development of computer cartography. This study aims to look into possibilities of the multiscale mapping by generalization in application with the coordinate transformation and LoD(level of detail) in the web cartography. A method of the coordinate transformation is to improve a transmission of spatial data. Lod is a method which is making web map with selection spatial data by zoom level of users. Layers for test constructed contour line, stream network, the name of a place, a summit of mountain, and administrative office. The generalization was applied to zoom levels by scale for the linear and polygonal features using XML-Based scalable vector graphics(SVG). Resultantly, storage capacity of data was minimized 41% from 9.76mb to 4.08mb in SVG. Generalization of LoD was applied to map elements by stages of the zoom level. In the first stages of zoom level, the main name of places and administrative office, higher order of stream channels, main summit of mountain was represented, and become increase numbers of map elements in the higher levels. Results of this study can help to improve esthetic map and data minimization in web cartography, and also need to make an efforts to research an algorithm on the map generalization over the web.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.3
• /
• pp.439-454
• /
• 2014

We deal with the boundedness of the n-th derivatives of Bloch-type functions and Toeplitz operators and give a relationship between Bloch-type spaces and ranges of Toeplitz operators. Also we prove that the vanishing property of ${\parallel}uk^{\alpha}_z{\parallel}_{s,{\alpha}}$ on the boundary of $\mathbb{D}$ implies the compactness of Toeplitz operators and introduce a generalization of Bloch-type spaces.

• The Pure and Applied Mathematics
• /
• v.30 no.3
• /
• pp.237-248
• /
• 2023

The aim of this paper is to study the concept of s-topological d-algebras which is a d-algebra supplied with a certain type of topology that makes the binary operation defined on it d-topologically continuous. This concept is a generalization of the concept of topological d-algebra. We obtain several properties of s-topological d-algebras.

• Kyungpook Mathematical Journal
• /
• v.56 no.3
• /
• pp.939-949
• /
• 2016

In this paper, we give an algorithm to construct a space curve in Euclidean 3-space ${\mathbb{E}}^3$ from a plane curve which is called PDP-helix of order d. The notion of the PDP-helices is a generalization of a general helix and a slant helix in ${\mathbb{E}}^3$. It is naturally shown that the PDP-helix of order 1 and order 2 are the same as the general helix and the slant helix, respectively. We give a characterization of the PDP-helix of order d. Moreover, we study some geometric properties of that of order 3.

• Korean Journal of Mathematics
• /
• v.18 no.3
• /
• pp.271-275
• /
• 2010

Let R be a commutative ring with identity, T(R) be the total quotient ring of R, and D be a ring such that $R{\subseteq}D{\subseteq}T(R)$ and D is a finite R-module. In this paper, we show that each regular ideal of R is finitely generated if and only if each regular ideal of D is finitely generated. This is a generalization of the Eakin-Nagata theorem that R is Noetherian if and only if D is Noetherian.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.3
• /
• pp.491-502
• /
• 2016

In this paper, as a generalization of symmetric bi-derivations and symmetric bi-f-derivations of a lattice, we introduce the notion of symmetric bi-(f, g)-derivations of a lattice. Also, we define the isotone symmetric bi-(f, g)-derivation and obtain some interesting results about isotone. Using the notion of $Fix_a(L)$ and KerD, we give some characterization of symmetric bi-(f, g)-derivations in a lattice.

• Journal of KIBIM
• /
• v.7 no.4
• /
• pp.8-20
• /
• 2017

When it comes to set up the BIM through the reverse engineering, the level of detail(LoD) required for finalized outcomes is different from each purpose. Therefore, it is necessary to establish some concrete criteria which describe the definition of LoDs on 3D modeling for the purpose of each reverse engineering. This research shows the criteria of the 1) positional accuracy, 2) generalization level, 3) scale level, 4) scope of description, and 5) the area available for application by classifying LoD from 1 to 6 on 3D modeling for each purpose of reverse engineering. Moreover, through applying those criteria for the 3D point cloud dataset of building made by terrestrial LiDAR, this research finds out the working hour of 3D modeling of reverse engineering by each LoDs according to defined LoD criteria for each level. It is expected that those findings, how those criteria of LoD on reverse engineering are utilized for modeling-workers to decide whether the outcomes can be suitable for their budget, applicable fields or not, would contribute to help them as a basic information.

• Journal of the Korean Mathematical Society
• /
• v.50 no.2
• /
• pp.331-360
• /
• 2013

Let ${\sigma}_s(N)$ denote the sum of the sth powers of the positive divisors of a positive integer N and let $\tilde{\sigma}_s(N)={\sum}_{d|N}(-1)^{d-1}d^s$ with $d$, N, and s positive integers. Hahn [12] proved that $$16\sum_{k. In this paper, we give a generalization of Hahn's result. Furthermore, we find the formula ${\sum}_{k=1}^{N-1}\tilde{\sigma}_1(2^{n-m}k)\tilde{\sigma}_3(2^nN-2^nk)$ for $m(0{\leq}m{\leq}n)$.