• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.66-69
• /
• 2002

This paper proposes a new dynamic storage structure and methods fur geometric data with detail levels. Using geometric data with detail levels, we can search geometric data quickly. However, the previous structures for detail levels form the bottleneck in the design of database and do not support all types of geometric data with detail levels. Our structure supports all types of geometric data with detail levels. Moreover, our structure does not form bottleneck in the design of database. This paper presents the structure and algorithms for searching and updating of geometric data with detail levels. Experiments are then performed.

• 한국HCI학회:학술대회논문집
• /
• 2008.02c
• /
• pp.224-224
• /
• 2008

Recent advances in model acquisition, computer-aided design, and simulation technologies have resulted in massive databases of complex geometric data occupying multiple gigabytes and even terabytes. In various graphics/geometric applications, the major performance bottleneck is typically in accessing these massive geometric data due to the high complexity of such massive geometric data sets. However, there has been a consistent lower growth rate of data access speed compared to that of computational processing speed. Moreover, recent multi-core architectures aggravate this phenomenon. Therefore, it is expected that the current architecture improvement does not offer the solution to the problem of dealing with ever growing massive geometric data, especially in the case of using commodity hardware. In this tutorial, I will focus on two orthogonal approaches--multi-resolution and cache-coherent layout techniques--to design scalable graphics/geometric algorithms. First, I will discuss multi-resolution techniques that reduce the amount of data necessary for performing geometric methods within an error bound. Second, I will explain cache-coherent layouts that improve the cache utilization of runtime geometric applications. I have applied these two techniques into rendering, collision detection, and iso-surface extractions and, thereby, have been able to achieve significant performance improvement. I will show live demonstrations of view-dependent rendering and collision detection between massive models consisting of tens of millions of triangles on a laptop during the talk.

• Korean Journal of Geomatics
• /
• v.5 no.1
• /
• pp.35-42
• /
• 2005

Precise geometric registration is required in multi-source data fusion process to obtain synergistic results successfully. However, most of the previous studies focus on the assumption of perfect registration or registration in a limited local area with intuitively derived simple geometric model. In this study, therefore, we developed a robust method for geometric registration based on a systematic model that is derived from the geometry associated with the data acquisition processes. The key concept of the proposed approach is to utilize smooth planar patches extracted from LIDAR data as control surfaces to adjust exterior orientation parameters of the aerial images. Registration of the simulated LIDAR data and aerial images was performed. The experimental results show that the RMS value of the geometric discrepancies between two data sets is decreased to less than ${\pm}0.30\;m$ after applying suggested registration method.

• Journal of Internet Computing and Services
• /
• v.3 no.2
• /
• pp.1-13
• /
• 2002

Recently, Internet GIS(Geographic Information System) is increasing. From the results, more efficient spatial data retrieval is needed. For more efficient retrieval, a spatial indexing method is needed. This paper proposes an efficient spatial indexing method for levelized geometric data retrieval. Previous indexing methods are not adequate to retrieve levelized geometric data. For the effects, a few indexing methods for levelized geometric data, are known. But these methods support only a tew kinds of levelized geometric data. The proposed method supports all kind of levelized geometric data and outperforms to the previous method both in retrieval time and memory capacity.

• Journal of the Korean Data and Information Science Society
• /
• v.8 no.2
• /
• pp.135-141
• /
• 1997

In this paper, it is investigated the properties of the transformed geometric Poisson process when the intensity function of the process is a distribution of the continuous random variable. If the intensity function of the transformed geometric Poisson process is a Pareto distribution then the transformed geometric Poisson process is a strongly P-process.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.216-218
• /
• 2003

QuickBird satellite is quickly becoming the best choice for high-resolution mapping using satellite images. In this paper, we will describe the followings: (1) how to correct QuickBird data using different geometric correction methods, (2) data fusion using QuickBird panchromatic and multispectral data, and (3) automatic DEM extraction using QuickBird stereo data.

• Journal of the Korean Data and Information Science Society
• /
• v.9 no.2
• /
• pp.305-310
• /
• 1998

In this paper, we introduce the conditions that the P-process has the intensity function which it is a standard form of gamma distribution. And we show that the transformed geometric Poisson process which the intensity function is a standard form of gamma distribution is a alternative sign P-process

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.3
• /
• pp.549-553
• /
• 2011

In this paper, we deal with the problem of deciding the length of data for estimating the parameters in geometric Brownian motion. As an approach to this problem, we consider the change point test and introduce simple test statistic based on the cumulative sum of squares test (cusum test). A real data analysis is performed for illustration.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.4
• /
• pp.294-305
• /
• 2004

Highly detailed geometric models are rapidly becoming commonplace in computer graphics and other applications. These complex models, which is often represented as complex1 triangle meshes, mainly suffer from the vast memory requirement for real-time manipulation of arbitrary geometric shapes without loss of data. Various techniques have been devised to challenge these problems in views of geometric processing, not a representation scheme. This paper proposes the new mesh structure for the compact representation and the efficient handling of the highly complex models. To verify the compactness and the efficiency, the memory requirement of our representation is first investigated and compared with other existing representations. And then we analyze the time complexity of our data structure by the most critical operation, that is, the enumeration of the so-called one-ring neighborhood of a vertex. Finally, we evaluate some elementary modeling functions such as mesh smoothing, simplification, and subdivision, which is to demonstrate the effectiveness and robustness of our mesh structure in the context of the geometric modeling and processing.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.848-853
• /
• 2005

3D geometric modeling of an object of interest has been intensively investigated in many fields including CAD/CAM and computer graphics. Traditionally, CAD and geometric modeling tools are widely used to create geometric models that have nearly the same shape of 3D real objects or satisfy designers intent. Recently, with the help of the reverse engineering (RE) technology, we can easily acquire 3D point data from the objects and create 3D geometric models that perfectly fit the scanned data more easily and fast. In this paper, we present 3D geometric model generation based on a stereo vision system (SVS) using random pattern projection. A triangular mesh is considered as the resulting geometric model. In order to obtain reasonable results with the SVS-based geometric model generation, we deal with many steps including camera calibration, stereo matching, scanning from multiple views, noise handling, registration, and triangular mesh generation. To acquire reliable stere matching, we project random patterns onto the object. With experiments using various random patterns, we propose several tips helpful for the quality of the results. Some examples are given to show their usefulness.