• Journal of Korean Society for Geospatial Information Science
• /
• v.9 no.2 s.18
• /
• pp.17-27
• /
• 2001

Buffering is one of the popular spatial analytical functions widely used in many proximity analyses. The buffeting inevitably entails a new polygon of specified edge that is simulated by rolling a ball around the buffering object. While buffering, the error on the buffering object propagates to the new buffered object. In this paper the error propagation behavior during the buffering operation is analyzed based on a pilot project for two different data models: polyline and spline curve. Thus, the error on the buffered objects are classified, mathematically defined, and measured. For measurements, the pilot project is designed and performed using a test site that is a lake boundary at Wisconsin, USA.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.1595-1598
• /
• 2003

이 논문은 질의와 검색 대상 객체가 모두 이동 객체인 경우, 즉 3 차원 폴리라인(polyline) 형태의 경로를 가지는 객체들 간의 연속(continuous) 최근접 질의 처리에 유용한 기법을 제안한다. 질의경로를 따라 객체를 탐색해가면서 질의에 대한 최근접 정보가 변하는 시점을 찾는 것이 목적인 연속 최근접 질의 처리는 전체 질의 경로에 올바른 최근접 정보 리스트를 제공하지만, 기존의 방법들은 검색 대상 객체가 동적인 경우에 적용되기에는 시간에 따라 움직이는 객체의 위치변화를 처리하지 못하고, 질의 시점과 대상 객체간의 시점을 연관시키기 어렵다는 문제점들을 가지고 있다. 따라서 이 논문에서는 데이터 객체들의 궤적 정보는 STR 트리로 유지하고, 질의 경로 세그먼트와 질의의 시간 인터벌에 포함되는 데이터 객체 세그먼트 모두에 대해 추출시간(sampling time) 선택, 스윕라인(sweep line) 적용, 위치 추정 함수 이용 등의 단계를 처리함으로써, 이 문제를 해결하고 질의 경로 전체에 정확한 최근접 객체 정보 리스트를 제공한다. 제안된 기법은 물류정보시스템, 국방정보시스템, 기상, 교통 등 시공간 이동 객체의 질의를 다루는 시스템에 적용할 수 있다.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.715-718
• /
• 2009

Time series data is a sequence of data points, measured typically at successive, spaced at time intervals. Many devices for an efficient exploration is developed according as the items of time series data increase. Among these devices, there is a Timebox widget as a representative device of dynamic query for interactive data exploration. Timeboxes are rectangular query region of interest. The users can draw the region of interest using simple mouse manipulation and the query result sets is displayed. But there is a limitation to represent the concrete query region and Timeboxes visualize the query region inconsistent with the mental model of users. To resolve these problems, we propose a new device called DQB(Dynamic Query Band). DQB is a qeury region consisting of user defined polyline with a thickness on time series data. This device is possible to concretely specify the query region. Also, it provides a simple and convenient interface and a good conceptual model.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.17 no.2
• /
• pp.117-128
• /
• 1999

A Simple tree-structured line simplification method, which exactly follows the Douglas-Peucker algorithm, has a strength for its simplification index to be involved into the hierarchical data structures. However, the hierarchy of simplification index, which is the core in a simple tree method, may not be always guaranteed. It is validated that the local property of line features in such global approaches as Douglas-Peucker algorithm is apt to be neglected and the construction of hierarchy with no thought of locality may entangle the hierarchy. This study designed a new approach, CALS(Convex hull Applied Line Simplification), a) to search critical points of line feature with convex hull search technique, b) to construct the hierarchical data structure based on these critical points, c) to simplify the line feature using multiple trees. CALS improved the spatial accuracy as compared with a simple tree method. Especially CALS was excellent in case of line features having the great extent of sinuosity.

• Journal of Computing Science and Engineering
• /
• v.5 no.3
• /
• pp.210-222
• /
• 2011

In this work, we study the problem of privacy-preservation data publishing in moving objects databases. In particular, the trajectory of a mobile user in a plane is no longer a polyline in a two-dimensional space, instead it is a two-dimensional surface of fixed width $2A_{min}$, where $A_{min}$ defines the semi-diameter of the minimum spatial circular extent that must replace the real location of the mobile user on the XY-plane, in the anonymized (kNN) request. The desired anonymity is not achieved and the entire system becomes vulnerable to attackers, since a malicious attacker can observe that during the time, many of the neighbors' ids change, except for a small number of users. Thus, we reinforce the privacy model by clustering the mobile users according to their motion patterns in (u, ${\theta}$) plane, where u and ${\theta}$ define the velocity measure and the motion direction (angle) respectively. In this case, the anonymized (kNN) request looks up neighbors, who belong to the same cluster with the mobile requester in (u, ${\theta}$) space: Thus, we know that the trajectory of the k-anonymous mobile user is within this surface, but we do not know exactly where. We transform the surface's boundary poly-lines to dual points and we focus on the information distortion introduced by this space translation. We develop a set of efficient spatiotemporal access methods and we experimentally measure the impact of information distortion by comparing the performance results of the same spatiotemporal range queries executed on the original database and on the anonymized one.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.6_1
• /
• pp.545-555
• /
• 2007

3D buildings are the most prominent feature comprising urban scene. A few of mega-cities in the globe are virtually reconstructed in photo-realistic 3D models, which becomes accessible by the public through the state-of-the-art online mapping services. A lot of research efforts have been made to develop automatic reconstruction technique of large-scale 3D building models from remotely sensed data. However, existing methods still produce irregular building polygons due to errors induced partly by uncalibrated sensor system, scene complexity and partly inappropriate sensor resolution to observed object scales. Thus, a geometric regularization technique is urgently required to rectify such irregular building polygons that are quickly captured from low sensory data. This paper aims to develop a new method for regularizing noise building outlines extracted from airborne LiDAR data, and to evaluate its performance in comparison with existing methods. These include Douglas-Peucker's polyline simplication, total least-squared adjustment, model hypothesis-verification, and rule-based rectification. Based on Minimum Description Length (MDL) principal, a new objective function, Geometric Minimum Description Length (GMDL), to regularize geometric noises is introduced to enhance the repetition of identical line directionality, regular angle transition and to minimize the number of vertices used. After generating hypothetical regularized models, a global optimum of the geometric regularity is achieved by verifying the entire solution space. A comparative evaluation of the proposed geometric regulator is conducted using both simulated and real building vectors with various levels of noise. The results show that the GMDL outperforms the selected existing algorithms at the most of noise levels.

• Journal of People, Plants, and Environment
• /
• v.24 no.1
• /
• pp.39-51
• /
• 2021

Background and objective: Urban topology can be characterized as impervious, which changes the hydrologic features of an area, increasing surface water flow during local heavy rain events. The pluvial flooding is also influenced by the vertical structures of the urban area. This study suggested a modified digital elevation model (DEM) to identify changes in urban hydrological conditions and segmentalized urban micro catchment areas using a geographical information system (GIS). Methods: This study suggests using a modified DEM creation process based on Rolling Ball Method concepts along with a GIS program. This method proposes adding realized urban vertical data to normal DEM data and simulating hydrological analyses based on RBM concepts. The most important aspect is the combination of the DEM with polygon data, which includes urban vertical data in three datasets: the contour polyline, the locations of buildings and roads, and the elevation point data from the DEM. DEM without vertical data (DCA) were compared with the DEM including vertical data (VCA) to analyze catchment areas in Shin-wol district, Seoul, Korea. Results: The DCA had 136 catchments, and the area of each catchment ranged from 3,406 m² to 423,449 m². The VCA had 2,963 catchments, with the area of each ranging from 50 m² to 16,209 m². The most important finding is that in the overlapped VCA; the boundary of areas directly affected by flooding and the direction of surface water flow could be identified. Flooding data from September 21, 2010 and July 27, 2011 in the Shin-wol district were applied as ground reference data. The finding is that in the overlapped VCA; the boundary of areas directly affected by flooding and the direction of surface water flow could be identified. Conclusion: The analysis of the area vulnerable to surface water flooding (SWF) was more accurately determined using the VCA than using the DCA.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.43 no.1
• /
• pp.139-147
• /
• 2023

As heavy precipitation rates have increased due to climate change, the risk of landslides has also become greater. Studies in the field of disaster risk assessment predominantly focus on evaluating intrinsic importance represented by the use or role of facilities. This work, however, focused on evaluating risks according to the external conditions of facilities, which were presented via debris flow simulation. A random walk model (RWM) was partially improved and used for the debris flow simulation. The existing RWM algorithm contained the problem of the simulation results being overly concentrated on the maximum slope line. To improve the model, the center cell height was adjusted and the inertia application method was modified. Facility information was collected from a digital topographic map layer. The risk level of each object was evaluated by combining the simulation result and the digital topographic map layer. A risk assessment technique suitable for the polygon and polyline layers was applied, respectively. Finally, by combining the evaluated risk with the attribute table of the layer, a system was prepared that could create a list of objects expected to be damaged, derive various statistics, and express the risk of each facility on a map. In short, we used an easy-to-understand simulation algorithm and proposed a technique to express detailed risk information on a map. This work will aid in the user-friendly development of a debris flow risk assessment system.