• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.581-588
• /
• 2002

In implementing interactive multimedia systems, real-time visualization plays an important role. This paper presents efficient data structures and algorithms for real-time terrain navigation. Terrain data set is usually too huge to display as is. Therefore LOD (levels of detail) methods and view frustum culling are essential tools. This paper describes in detail compact hierarchical data structures, fast view frustum culling, and efficient LOD construction/rendering algorithms. Unlike previous works, we use a precise screen-space error metric for vertex removal and a strict error threshold allowing sub-pixel -sized errors only. Nevertheless, we can achieve 22 fps on average in a PC platform. The methods presented in this paper also satisfy almost all of the requirements for interactive real-time terrain Visualization.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.35 no.2
• /
• pp.103-112
• /
• 2017

Due to the large size and high complexity of modern buildings, the interest and the studies about indoor spatial information are increasing. Previous studies related to indoor spatial information were mostly about relevant technologies, and the application of indoor spatial information has been less studied. In the present study, the public administrative work areas where indoor spatial information may be applied were identified by using a modified delphi technique. And the indoor LOD (Level of Detail) and indoor positioning accuracy for indoor spatial information applications considering user requirements was established as standards for efficiently establishing and providing services. The required LOD and positioning accuracy for services was established by reestablishing indoor LOD and positioning accuracy and classifying services with reference to those. The indoor LOD was reestablished from LOD 0 to 4 by focusing on service utilization and general recognition, and the positioning accuracy was reestablished in three levels by considering the accuracy of the present positioning technology and service utilization status.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.766-775
• /
• 2000

Representing 3-D objects with LOD requires a set of appropriate meshes according to the detail requirements. We have developed a system for improved geometry model data transmission and management by having only the wavelet coefficienets of the model corresponding to the detail levels, instead of generation all the meshes through wavelet transformation, when generating multiresolution meshes.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.828-831
• /
• 2005

In feature-based multi-resolution modeling, the features are rearranged according to a criterion for the levels of detail (LOD) of multi-resolution models. In this paper, two different LOD criteria are investigated and discussed. The one is the volumes of subtractive features, together with the precedence of additive features over subtractive features. The other is the volumes of features, regardless of whether the feature types are subtractive or additive. In addition, the algorithms to define and extract the LOD models based on the criteria are also described. The criterion of the volumes of features can be used for a wide range of applications in CAD and CAE in virtue of its generality.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.6
• /
• pp.444-454
• /
• 2005

Recently, the requirements of multi-resolution models of a solid model, which represent an object at multiple levels of feature detail, are increasing for engineering tasks such as analysis, network-based collaborative design, and virtual prototyping and manufacturing. The research on this area has focused on several topics: topological frameworks for representing multi-resolution solid models, criteria for the level of detail (LOD), and generation of valid models after rearrangement of features. As a solution to the feature rearrangement problem, the new concept of the effective zone of a feature is introduced in the former part of the paper. In this paper, we propose a feature-based non-manifold modeling system to provide multi-resolution models of a feature-based solid or non-manifold model on the basis of the effective feature zones. To facilitate the implementation, we introduce the class of the multi-resolution feature whose attributes contain all necessary information to build a multi-resolution solid model and extract LOD models from it. In addition, two methods are introduced to accelerate the extraction of LOD models from the multi-resolution modeling database: the one is using an NMT model, known as a merged set, to represent multi-resolution models, and the other is storing differences between adjacent LOD models to accelerate the transition to the other LOD. We also suggest the volume of the feature, regardless of feature type, as a criterion for the LOD. This criterion can be used in a wide range of applications, since there is no distinction between additive and subtractive features unlike the previous method.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2002.11a
• /
• pp.163-170
• /
• 2002

Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces for realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. In order to accelerate the searching speed of T-search, a terrain database of triangular polygons is modeled in multi-levels by adopting the LOD (Level of Detail) method used in realtime computer graphics. Simulation results show that the new LOD search is effective in shortening the required computing time. The LOD search can be even further accelerated by introducing an NN (Neural Network) algorithm, in the cases where a appropriate range of moving paths can be predicted by cultual information of the simulated terrain, such as lakes, houses, etc.. Numerical tests show that LOD-NN search almost double the speed of the original T-search.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.19 no.7
• /
• pp.22-34
• /
• 2020

Three-dimensional (3D) computer-aided design (CAD) models require different levels of detail (LODs) depending on their purpose. Therefore, it is beneficial to automatically simplify 3D CAD assembly models to meet the desired LOD. Feature-based 3D CAD assembly models typically have the lowest and highest feasible limits of LOD during simplification. In order to help users obtain a feasible simplification result, we propose a method to simplify feature-based 3D CAD assembly models by determining the lowest and highest limits of LOD. The proposed method is verified through experiments using a simplification prototype implemented as a plug-in type module on Siemens NX.

• Journal of Mechanical Science and Technology
• /
• v.19 no.2
• /
• pp.549-557
• /
• 2005

The requirements of multi-resolution models of feature-based solids, which represent an object at many levels of feature detail, are increasing for engineering purposes, such as analysis, network-based collaborative design, virtual prototyping and manufacturing. To provide multi-resolution models for various applications, it is essential to generate adequate solid models at varying levels of detail (LOD) after feature rearrangement, based on the LOD criteria. However, the non-commutative property of the union and subtraction Boolean operations is a severe obstacle to arbitrary feature rearrangement. To solve this problem we propose history-based Boolean operations that satisfy the commutative law between union and subtraction operations by considering the history of the Boolean operations. Because these operations guarantee the same resulting shape as the original and reasonable shapes at the intermediate LODs for an arbitrary rearrangement of its features, various LOD criteria can be applied for multi-resolution modeling in different applications.

• Journal of the Korea Computer Graphics Society
• /
• v.13 no.3
• /
• pp.19-24
• /
• 2007

In this paper, we describe a method of defining an object's real length in order to compare objects' lengths precisely using all real length units in the real world. The browser in our study represents an object's length by referencing to the physical length property defined at modeling when it displays the object. Since objects' lengths are appropriately scaled according to these units, objects can be precisely and visually compared in sire using real world length units. The concept of defining the real length unit is extended to the X3D specification. The units are ranged from $10^{-24}(yotta)\;to\;10^{24}(yocto)$. In addition, we explain the method for processing LOD (Levels Of Detail) and for applying the property of LOLD (Levels of Length Detail) when objects with different LOLD are read into the browser.

• Journal of Mechanical Science and Technology
• /
• v.19 no.2
• /
• pp.558-566
• /
• 2005

We propose a feature-based multi-resolution representation of B-rep solid models using history-based Boolean operations based on the merge-and-select algorithm. Because union and subtraction are commutative in the history-based Boolean operations, the integrity of the models at various levels of detail (LOD) is guaranteed for the reordered features regardless of whether the features are subtractive or additive. The multi-resolution solid representation proposed in this paper includes a non-manifold topological merged-set model of all feature primitives as well as a feature-modeling tree reordered consistently with a given LOD criterion. As a result, a B-rep solid model for a given LOD can be provided quickly, because the boundary of the model is evaluated without any geometric calculation and extracted from the merged set by selecting the entities contributing to the LOD model shape.