• Journal of the Korea Computer Graphics Society
• /
• v.4 no.1
• /
• pp.11-19
• /
• 1998

Non-manifold topological operations such as Euler and Boolean operations provide a versatile environment for modeling domains. The implementation of these operations raises geometrical issues that need to be addressed to ensure the topological validity of the underlying model, and they uses the glue operation which provides a basic method to modify the topology of non-manifold models when vertices, edges and faces are contacting each other. Topological information such as adjacency relationships should be inferred when gluing non-manifold models. Two methods of reasoning can be employed to find the topological information : topological reasoning and geometrical reasoning. The topological method can infer the adjacency relationships by using stored topological information. On the other hand, the geometrical method can find topological ambiguities by considering the geometrical shape at the local area of gluing when the topological relations were not stored. This paper describes the geometrical reasoning method.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.128-132
• /
• 2002

One of the fundamental components important to the analysis of spatial objects is to represent topological relationships between spatial features. Users of geographic information systems retrieve a lot of objects from spatial database and analyze their condition by means of topological relationships. The existing methods that represent these relationships have the disadvantage that they have limited information in $R^2$. In this paper, we represent and define the topological relationships between 3-dimensional spatial objects using the several representing methods of 2-dimensional features. We use the diverse representing methods, which include the 4-, 9-intersection, dimension extended and calculus-based method. Furthermore, we discuss OGC's topological relationships and operators for 3-dimensional spatial data.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.5
• /
• pp.444-449
• /
• 2006

Path planning is a key element in navigation of a mobile robot. Several algorithms such as a gradient method have been successfully implemented so for. Although the gradient method can provide the global optimal path, it computes the navigation function over the whole environment at all times, which result in high computational cost. This paper proposes a high-speed path planning scheme, called a gradient method with topological information, in which the search space for computation of a navigation function can be remarkably reduced by exploiting the characteristics of the topological information reflecting the topology of the navigation path. The computing time of the gradient method with topological information can therefore be significantly decreased without losing the global optimality. This reduced path update period allows the mobile robot to find a collision-free path even in the dynamic environment.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.3
• /
• pp.150-160
• /
• 1997

Existing non-manifold data structures which use the ordered topological representation method, are designed based on a "Model" which is the highest topological entity. Their non-manifold information is always included in edges and vertices even if they are in the manifold situation. Thus they require large storage spaces than manifold data structures. The proposed data structure reduces its storage space by removing unnecessary information stored in edges and vertices. Topological information is classified into manifold and non-manifold information. The main non-manifold information is radial cycles and disk cycles. The proposed data structure always stores manifold information. For the non-manifold situation, the edge stores radial cycles, and the vertex stores disk cycles. The storage space can be reduced in the later stage of CAD design when the ratio of non-manifold to manifold entities is small.

• ETRI Journal
• /
• v.29 no.2
• /
• pp.189-200
• /
• 2007

This paper addresses the localization and navigation problem in the movement of service robots by using invisible two dimensional barcodes on the floor. Compared with other methods using natural or artificial landmarks, the proposed localization method has great advantages in cost and appearance since the location of the robot is perfectly known using the barcode information after mapping is finished. We also propose a navigation algorithm which uses a topological structure. For the topological information, we define nodes and edges which are suitable for indoor navigation, especially for large area having multiple rooms, many walls, and many static obstacles. The proposed algorithm also has the advantage that errors which occur in each node are mutually independent and can be compensated exactly after some navigation using barcodes. Simulation and experimental results were performed to verify the algorithm in the barcode environment, showing excellent performance results. After mapping, it is also possible to solve the kidnapped robot problem and to generate paths using topological information.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2834-2836
• /
• 2000

This paper introduces the behavior-based learning controller for mobile robot using topological map. When the mobile robot navigates to the goal position, it utilizes given information of topological map and its location. Under navigating in unknown environment, the robot classifies its situation using ultrasonic sensor data, and calculates each motor schema multiplied by respective gain for all behaviors, and then takes an action according to the vector sum of all the motor schemas. After an action, the information of the robot's location in given topological map is incorporated to the learning module to adapt the weights of the neural network for gain learning. As a result of simulation, the robot navigates to the goal position successfully after iterative gain learning with topological information.

• East Asian mathematical journal
• /
• v.18 no.2
• /
• pp.211-218
• /
• 2002

In this paper, we introduce the notion of almost topological convergence spaces and almost pretopological convergence spaces, and prove that these are product invariant.

• Proceeding of EDISON Challenge
• /
• 2014.03a
• /
• pp.516-520
• /
• 2014

Fractional quantum Hall Effect (FQSH) is one of most fundamental issues in condensed matter physics, and the Topological insulator becomes its prominent applications. This article reviews the general frameworks of these development and the physical properties. FQSH states and topological insulators are supposed to be topologically invariant under the minor change of geometrical shape or internal impurities. The phase transitions involved in this phenomena are known not to be explained in terms of symmetry breaking or Landau-Ginsburg theory. The new type of phase transitions related to topological invariants has acquired new name - topological phase transition. The intuitive concepts and the other area having same type of phase transitions are discussed.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.9
• /
• pp.25-34
• /
• 1999

In spite of the advance of 3D solid modeling technology, there are some distinct areas where 2D CAD S/W are still dominant, and more competent comparing with 3D CAD S/W. For example, in the manufacturing of 2D-shaped electrical parts, most related manufacturing tools have 2D geometric features by nature, and 3D solid models applied to these parts have substantial overheads. Nevertheless, most 2D CAD S/W have no topological inquiry services because they have no such information on their geometrical database inherently. Thus, it is needed to extract such information from 2D CAD database for developing more advanced application such as automated drafting/design S/W. In this paper, the extraction of topological information from 2D CAD has been performed in general way using concept of B-rep. A general extraction algorithm, data structure and meta file format for 2D topological object have been developed and successfully applied to the development of the automated lead frame die design system in Samsung Aerospace. it is also possible to provide a flexible, powerful topology-oriented functionality on any common 2D CAD S/W.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.93-105
• /
• 2011

In recent years, large and complex three-dimensional building has been constructed by the development of building technology and advanced IT skills, and people have lived there and spent a considerable time so far. Accordingly. in this sophisticatcd three-dimensional space, emergencies services or convenient information services have been in demand. In order to provide these services efficiently, understanding of topological relationships among the complex space should be supported naturally. Not on1y each method of understanding the topological relationships but also its efficiency can be different depending on different topological data models. B-rep based data model is the most widely used for storaging and representing of topological relationships. And from early 2000s, many researches on a network based topological data model have been conducted. The purpose of this study is to verify the efficiency of performance on spatial queries. As a result, Network-based topological data model is more efficient than B-rep based data model for determining the spatial relationship.