• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1617-1622
• /
• 1991

Plane sweep is a general method in computational geometry. There are many efficient theoretical algorithms designed using plane sweep technique. However, their practical implementations are still suffering from the topological inconsistencies resulting from the numerical errors in geometric computations with finite-precision arithmetic. In this paper, we suggest new implementation techniques for the plane sweep algorithms to resolve the topological inconsistencies and construct the planar object boundaries from given input curve segments.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.691-693
• /
• 2002

일반화 다각형(generalized polygons)이란 선분과 호로 둘러싸인 $R^2$영역으로 정의되는 확장된 다각형 개념으로 로보틱스 등의 응용 분야에서 다루는 중요한 도형군이다. 로보틱스에 응용되는 컴퓨터 기하학 알고리즘의 대부분은 선분이나 다각형을 다루도록 개발되어 있어 로봇 작업환경의 다양한 물체들을 선분만으로 모델링해야만 알고리즘의 적용이 가능하다. 기존의 알고리즘들을 일반화 다각형을 다룰 수 있도록 확대한다면 보다 유연한 모델링을 가능하게 할 것이다. 주 논문에서는 컴퓨터 기하학분야의 대표적인 알고리즘인 plane-sweep 알고리즘을 일반화 다각형을 다룰 수 있도록 수정하고 구현한다. 이를 로보틱스이 응용분야중 하나인 고정쇠 문제(fixturing)에 적용한다.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.162-171
• /
• 1999

Plane sweep plays an important role in computational geometry. This paper shows that an extension of topological plane sweep to three-dimensional space can calculate the volume swept by rotating a solid polyhedral object about a fixed axis. Analyzing the characteristics of rotational swept volumes, we present an incremental algorithm based on the three-dimensional topological sweep technique. Our solution shows the time bound of O(n²·2?+T?), where n is the number of vertices in the original object and T? is time for handling face cycles. Here, α(n) is the inverse of Ackermann's function.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.1087-1094
• /
• 1987

In this paper, we describe about polygon resizing porblem where the given polygons are expanded or shrunk in two dimensional plane. First, the definition of polygon resizing and it's problems are given, then the enhanced XY method is proposed: the polygon resizing can be completed in one directional sweep of plane only, usisng enhanced plane sweep method. The time complexity is 0(n log n), and space complexity 0(\ulcorner), where n is the number of verties of polygons. The applications of polygon resizing to the mask artwork processing and layout verification are discussed.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.426-429
• /
• 2001

Many various products are manufactured which have sculptured surfaces recently. Constructing surface of these models is required technique called reverse engineering. In reverse engineering, a product which has sculptured surfaces is measured and we create surface model to acquire complete model data of object. Measured point data needs preprocess and sampling. Next a set of point data in a plane fit section curve. At last, surface is generated by fitting to section curves. Here we uses sweep surface. Sweep surface is compatible fitting CAD model to drawing. This paper discusses converting approximation of NURBS surface as a standard surface.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.716-719
• /
• 2005

We present an algorithm for finding shortest paths in the L$_1$ plane with a transportation network. The transportation network consists of parallel line segments, called highways, through which a movement gets faster. Given a source point s, our algorithm constructs a Shortest Path Map(SPM) such that for any query point t, we can find the length of a shortest path form s to t in O(log n) time. We design a plane sweep-like algorithm computing SPM in O(nlog n) time.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.195-199
• /
• 2008

We present an approach to detect real plane for line base recognition and pose estimation Given 3D line segments, we set up reference plane for each line pair and measure the normal distance from the end point to the reference plane. And then, normal distances are measured between remains of line endpoints and reference plane to decide whether these lines are coplanar with respect to the reference plane. After we conduct this coplanarity test, we initiate visibility test using z-buffer value to prune out ambiguous planes from reference planes. We applied this algorithm to real images, and the results are found useful for evidence fusion and probabilistic verification to assist the line based recognition as well as 3D pose estimation.

• Journal of the Korea Society for Simulation
• /
• v.15 no.2
• /
• pp.31-39
• /
• 2006

The visibility graph is a well-known method for efficient path-finding with the minimum search space modelling the game world. The generalized visibility graph is constructed on the expanded obstacle boundaries to eliminate the "wall-hugging" problem which is a major disadvantage of using the visibility graph. The paths generated by the generalized visibility graph are guaranteed to be near optimal and natural-looking. In this paper we propose the method to apply the generalized visibility graph efficiently for game characters who moves among static obstacles between varying start and goal points. Even though the space is minimal once the generalized visibility graph is constructed, the construction itself is time-consuming in checking the intersection between every two links connecting nodes. The idea is that we build the map for static obstacles first and then incorporate start and goal nodes quickly. The incorporation of start and goal nodes is the part that must be executed repeatedly. Therefore we propose to use the rotational plane-sweep algorithm in the computational geometry for incorporating start and goal nodes efficiently. The simulation result shows that the execution time has been improved by 39%-68% according to running times in the game environment with multiple static obstacles.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2012.05a
• /
• pp.173-179
• /
• 2012

Steady and unsteady three-dimensional RANS simulations have been performed on partial admission supersonic axial turbine having backward/forward sweep angles(${\pm}15^{\circ}$) and the results are compared with each other. The objective of this paper is to study the effect of unsteadiness on turbine flow characteristics and performances. The all results indicated that the losses of unsteady simulations were greater than those of steady cases. It was also shown that BSW model give the effect on the reducing of mass flow rates of tip leakage. In unsteady simulation, the increase of t-to-s efficiency at Rotor Out plane was observed more clearly.

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

In this paper, the techniques for graphic simulation of material removal process are described. The concepts of the bounding box and base plane are proposed. With these concepts, a real-time shaded display of a Z-map model being milled by a cutting tool following an NC path can be implemented very efficiently. The base planes make it possible to detect the visible face of Z-map model effectively. And the bounding box of tool sweep volume provides minimum area of screen to be updated. The proposed techniques are suitable for implementation in raster graphic device and need a few memories and a small amount of calculation. Proposed method is written in C and executable on MS-Windows95 and Window-NT.