• Proceedings of the Korean Institute of Interior Design Conference
• /
• 2005.10a
• /
• pp.143-146
• /
• 2005

Human activity pattern has been changed as the contemporary urban society changes. Diverse activities repeat regular patterns as time passes. Diagram is a simple drawing which aims to organize and unify various information. The elements of the social behaviour could be spatialized by means of diagram applications. By using diagrams, architects understand contemporary urban society and form new space conditions. Time-based activity patterns consists of activity pattern in a restricted space and in urban structure for space use. Activity patterns for different time zones are explained by two types of diagrams, space occupation and flexibility of space, By the characteristic of space system structred by these diagrams, activities and programs are rearranged and variety of space is allowed through flexibility. Also, programs are mixed to apply to simultaneous occurrence of ever-changing human activities.

• Archives of design research
• /
• v.19 no.5 s.67
• /
• pp.75-84
• /
• 2006

The aims of this study are to examine the conceptual contents of space diagram, and to find its elements and practical applications by analyzing the UN Studio. The Findings of this study are as follows: firstly, the conceptual contents represented in space diagram are classified into four elements - motif, flow, relationship, and distribution. Secondly, space diagram is used in program development, schematic design, and preliminary design of design process phases. Thirdly, the elements based on the case diagrams include five elements: context analysis, object analysis, time-behavior analysis, modeling analysis, and space analysis. Fourthly, in practical use, diagrams with motif concept is usually used in modeling analysis, and diagram with flow concept is commonly used in the analysis of time-behavior and object. Diagrams with relationship concept is mostly used in space analysis, secondly in analysis of context and modeling. Further, diagrams with distribution concept is usually used in space analysis. If one uses these findings for design projects in practical business or education, it would be helpful in design conception and development as well as of design information structuralization.

• International Journal of CAD/CAM
• /
• v.5 no.1
• /
• pp.59-68
• /
• 2005

Euclidean Voronoi diagram of spheres in 3-dimensional space has not been explored as much as it deserves even though it has significant potential impacts on diverse applications in both science and engineering. In addition, studies on the data structure for its topology have not been reported yet. Presented in this, paper is the topological representation for Euclidean Voronoi diagram of spheres which is a typical non-manifold model. The proposed representation is a variation of radial edge data structure capable of dealing with the topological characteristics of Euclidean Voronoi diagram of spheres distinguished from those of a general non-manifold model and Euclidean Voronoi diagram of points. Various topological queries for the spatial reasoning on the representation are also presented as a sequence of adjacency relationships among topological entities. The time and storage complexities of the proposed representation are analyzed.

• The KIPS Transactions:PartA
• /
• v.19A no.4
• /
• pp.169-174
• /
• 2012

We present an algorithm that computes a 3 dimensional Voronoi diagram for a protein molecule in this paper. The molecule is represented as a set of spheres with van der Waals radii. The Voronoi diagram is constructed in the 3D space by finding the voxels containing it. For the feasibility of the computation, we represent the molecule as a BVH (bounding volume hierarchy), and our system is accelerated by modern graphics hardware with CUDA programming support. Compared to single-core CPU implementations, experimental results show 323 times faster performance in the computation time, when the space is partitioned into $2^{24}$ voxels.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.2
• /
• pp.127-133
• /
• 2014

This paper proposes a determination method of waypoints to maximize the survivability of a UAV. Voronoi diagram which is used for the initial selection of waypoint candidates is the most widely used path planning technique to avoid the threat as far as possible when the location and strength of the threat are given. But if threat strength is different each other and flight path is constrained along with straight lines, Voronoi diagram has limitations in real applications. In this study, the initial waypoints obtained from Voronoi diagram are optimized considering the shape of each threat. Here, a waypoint is optimized while adjacent waypoints are fixed. By repeating this localized optimization until whole waypoints are converged, computation time for finding the best waypoints is greatly reduced.

• Journal of Korea Multimedia Society
• /
• v.3 no.3
• /
• pp.298-308
• /
• 2000

We present an efficient algorithm for finding the sequence of extreme vortices of a moving regular convex polyhedron of with respect to a fixed plane H.. The algorithm utilizes the spherical Voronoi diagram that results from the outward unit normal vectors nF$_{i}$ 's of faces of P. It is well-known that the Voronoi diagram of n sites in the plane can be computed in 0(nlogn) time, and this bound is optimal. However. exploiting the convexity of P, we are able to construct the spherical Voronoi diagram of nF$_{i}$ ,'s in O(n) time. Using the spherical Voronoi diagram, we show that an extreme vertex problem can be transformed to a spherical point location problem. The extreme vertex problem can be solved in O(logn) time after O(n) time and space preprocessing. Moreover, the sequence of extreme vertices of a moving regular convex polyhedron with respect to H can be found in (equation omitted) time, where m$^{j}$ $_{k}$ (1$\leq$j$\leq$s) is the number of edges of a spherical Voronoi region sreg(equation omitted) such that (equation omitted) gives one or more extreme vertices.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2004.05a
• /
• pp.106-110
• /
• 2004

In any large heavy industry like that of ship building, there exist a lot of complications for the arrangement of building blocks optimally for the minimal space consumption. The major problem arises at yard because of laxity in space for arranging the building blocks of ship under construction. A standardized erection sequence diagram is generally available to provide the prioritised erection sequence. This erection sequence diagram serves as the frame work. In order to make a timely erection of the blocks a post plan has to be developed so that the blocks lie in the nearest possible vicinity of the material handling devices while keeping the priority of erection. Therefore, the blocks are arranged in the pre-erection area. This kind of readiness of blocks leads to a very complex problem of space. This arises due to the least available space leading to an urgent need of an availability of intelligent spatial schedule without compromising the rate of production. There exists two critical problems ahead namely, the spatial occupation layout of pre-erection area and the emptying pattern in the spatial vicinity. The block shape is assumed be rectangular. The related input data's are the dates of erection (earliest as well as the latest), geometrical parameters of block available on pre-erection area, slack time and the like.

• Journal of Astronomy and Space Sciences
• /
• v.27 no.2
• /
• pp.89-96
• /
• 2010

BVR CCD observations of GW Cep were made on 15 nights in November through December 2008 with a 1-m reflector at the Jincheon station of the Chungbuk National University Observatory. Nineteen new times of minimum lights for GW Cep were determined and added to a collection of all other times of minima available to us. These data were then intensively analyzed, by reference to an O-C diagram, to deduce the general form of period variation for GW Cep. It was found that the O-C diagram could be interpreted as presenting two different forms of period change: an exclusively quasi-sinusoidal change with a period of 32.6 years and an eccentricity of 0.10; and a quasi-sinusoidal change with a period of 46.2 years and an eccentricity of 0.36 superposed on an upward parabola. Although a final conclusion is somewhat premature at present, the latter seems more plausible because late-type contact binaries allow an inter-exchange of both energy and mass between the component stars. The quasi-sinusoidal characteristics were interpreted in terms of a light-time effect due to an unseen tertiary component. The minimum masses of the tertiary component for both cases were calculated to be nearly the same as the $0.23-0.26M\;{\odot}$-ranges which is hardly detectable in a light curve synthesis. The upward parabolic O-C diagram corresponding to a secular period increase of about $4.12{\times}10^{-8}\;d/yr$ was interpreted as mass being transferred from the lesser to more massive component. The transfer rate for a conservative case was calculated to be about $2.66\;{\times}\;10^{-8}\;M_{\odot}/yr$ which is compatible with other W UMa-type contact binaries.

• International journal of advanced smart convergence
• /
• v.12 no.1
• /
• pp.1-8
• /
• 2023

Smart IoT over high speed network and high performance smart devices explodes the ubiquitous services and applications. Nearest Neighbor(NN) query is one of the important type of queries that have to be supported for ubiquitous information services. In order to process efficiently NN queries in the wireless broadcast environment, it is important that the clients determine quickly the search space and filter out NN from the candidates containing the search space. In this paper, we propose a hybrid index of Voronoi and grid partition to provide quick search space decision and rapid filtering out NN from the candidates. Grid partition plays the role of helping quick search space decision and Voronoi partition providing the rapid filtering. We show the effectiveness of the proposed index by comparing the existing indexing schemes in the access time and tuning time. The evaluation shows the proposed index scheme makes the two performance parameters improved than the existing schemes.

• Journal of Astronomy and Space Sciences
• /
• v.28 no.2
• /
• pp.103-108
• /
• 2011

The latitudinal variation of sunspots appearing during the period from 1874 to 2009 has been studied in terms of centerof-latitude (COL). The butterfly diagram has been used to study the evolution of the magnetic field and the dynamics at the bottom of the solar convection zone. Short-term periodicities have been of particular interest, in that they are somehow related to the structure and dynamics of the solar interior. We thus have focused our investigation on shortterm periodicities. We first calculated COL by averaging the latitude of sunspots with the weight function in area. Then, we analyzed the time series of COL using the wavelet transform technique. We found that a periodicity of ~5 years is the most dominant feature in the time series of COL, with the exception of the ~11 year solar cycle itself. This periodicity can be easily understood by considering small humps between the minima in the area-weighted butterfly diagram. However, we find that periodicities of ~1.3 (0.064), ~1.5 (0.056), or ~1.8 (0.046) years ($\frac{1}{month}$), month ), which have been previously suggested as evidence of links between the changing structure of the sunspot zone and the tachocline rotation rate oscillations, are insignificant and inconsistent. We therefore conclude that the only existing short-term periodicity is of ~5 years, and that periodicities of ~1.3, ~1.5, or ~1.8 years are likely to be artifacts due to random noise of small sunspots.