• Journal of the Korean housing association
• /
• v.10 no.2
• /
• pp.175-183
• /
• 1999

This study aims at modeling the compositional method in the architectural space and shape. The composition of space is composed of the position and the area in space. Therefore these elements are established to the functional program applied at the behavioral data. The element of spatial structure is position and scale in space, and the composition of spatial shape is developed repitionally to the combination of build-up method. The functional program is being expertised and the scale in building being lager, the importance of functional program is increased. Applied at data of the functional program at spatial structure, the process is developed to the method of combination. The purpose of this study is approached at the degree of application in modeling on the compositional method in architectural space and shape, which is a fundamental aspect on the quantitative analysis of architectural space.

• Journal of Korea Multimedia Society
• /
• v.5 no.4
• /
• pp.361-371
• /
• 2002

An efficient access technique is one of the most Important requirements in GIS. Using level -of-detailed data, we can access spatial data efficiently, because of no access to the fully detailed spatial data. Previous spatial access methods do not access data with level of detail efficiently. To solve it, a few spatial access methods for spatial data with level of detail, are known. However these methods support only a few kinds of data with level of detail, i.e, data through selection and simplification operations. For the effects, we propose a new spatial indexing method supporting fast searching in all kinds of data with level of detail. In the proposed method, the collection of indexes in its own level are integrated into a single index structure. Experimental results show that our method offers both no data redundancy and high search performance.

• Spatial Information Research
• /
• v.3 no.1
• /
• pp.55-63
• /
• 1995

The database design, which logically sets the base structure and orga¬nization of the database, is performed by considering the users requirement, the relations between various data, and the relations between data and application field.The road network data must be created to have geometrical topological structure, because various data elements are needed to recognize the state of each section and to relate between data element. In this study, we propose a method of creating the road network database for an integrated road management system.

• Architectural research
• /
• v.17 no.2
• /
• pp.57-64
• /
• 2015

In architectural planning, previous cases of similar spatial program provide important data for architectural design. Case-based reasoning (CBR) paradigm in the field of architectural design is closely related to the designing behavior of a planner who makes use of similar architectural designs and spatial programs in the past. In CBR, spatial graph can be constituted with most fundamental data, which can provide a method of searching spatial program by using visual graphs. This study developed a system for CBR that can analyze the similarity through graph comparison and search for buildings. This is an integrated system that is able to compare space similarity of different buildings and analyze their types, in addition to the analysis on a space within a single structure.

• Spatial Information Research
• /
• v.16 no.1
• /
• pp.113-127
• /
• 2008

This paper proposes an efficient spatial index, named $AR^*$-tree(Area $R^*$-tree) which is a variant of the $R^*$-tree, for mobile software. A MBR(Minimum Bounding Rectangle) structure of the $AR^*$-tree has additional min and max values of area axis as well as x and y axes. The value of area axis is used to determine the significance of a spatial data. If area of a spatial data is large, then it is significant when drawing a map. To reduce complexity of a map on a small screen of mobile device, only significant spatial data can be found by the $AR^*$-tree. The result of a series of tests indicates that the $AR^*$-tree provides a method for control of readability of a map and guarantees an efficient performance at the same time.

• Spatial Information Research
• /
• v.7 no.2
• /
• pp.271-282
• /
• 1999

In this paper, we derived an efficient indexing scheme, SJ tree, which handles multi-attribute data and spatial join operations efficiently. In addition, a number of algorithms for manipulating multi-attribute data are given , together with their computational and I/O complexity . Moreover , we how that SJ tree is a kind of generalized B-tree. This means that SJ-tree can be easily implemented on existing built-in B-tree in most storage managers in the sense that the structure of SJ tree is like that of B-tree. The spatial join operation with spatial output is benchmarked using R-tree, B-tree, K-D-B tree, and SJ tree. Results from the benchmark test indicate that SJ tree out performance other indexing schemes on spatial join with point data.

• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1529-1541
• /
• 2006

Moving objects have been widely employed in traffic and logistic applications. Spatio-temporal aggregations mainly describe the moving object's behavior in the spatial data warehouse. The previous works usually express the object moving in some certain region, but ignore the object often moving along as the trajectory. Other researches focus on aggregation and comparison of trajectories. They divide the spatial region into units which records how many times the trajectories passed in the unit time. It not only makes the storage space quite ineffective, but also can not maintain spatial data property. In this paper, a spatio-temporal aggregation index structure for moving object trajectory in constrained network is proposed. An extended B-tree node contains the information of timestamp and the aggregation values of trajectories with two directions. The network is divided into segments and then the spatial index structure is constructed. There are the leaf node and the non leaf node. The leaf node contains the aggregation values of moving object's trajectory and the pointer to the extended B-tree. And the non leaf node contains the MBR(Minimum Bounding Rectangle), MSAV(Max Segment Aggregation Value) and its segment ID. The proposed technique overcomes previous problems efficiently and makes it practicable finding moving object trajectory in the time interval. It improves the shortcoming of R-tree, and makes some improvement to the spatio-temporal data in query processing and storage.

• Journal of KIBIM
• /
• v.5 no.3
• /
• pp.1-10
• /
• 2015

We have researched a character of BIM(Building Information Modeling) and GIS(Geographic Information System) data for integrated utilization of urban spatial data and building data for $CO_2$ reduction. We consider literature on integrated utilization of BIM and GIS and measure method of $CO_2$ in urban spatial unit. Among them without distortion of standard data structure, derive method how to install between BIM and GIS standard data. Rhino & Grasshopper is utilization tools of DB platform. The compatibility with existing BIM and GIS data format, graphic and numeric results can be output at the same time. And using the existing ARCHSIM, it can be easily combined for building energy analysis program. Based on BIM and GIS data to run an energy analysis target on Majang-dong, it could be poly synthetically derived the value information and graphic information.

• Journal of Korea Spatial Information System Society
• /
• v.1 no.2 s.2
• /
• pp.127-135
• /
• 1999

Currently, many geographic information systems deal with only vector data. Therefore, handling raster data for various types of information is greatly needed. In this paper, we design and implement a raster processor which handles spatial information in a spatial object management system called Object Management system for Geospatial Application (OMEGA). We define the data structure of the raster information to be stored in the spatial object management system and implement it to a class library in order for use in making an application program. Furthermore, a query operation and related module is implemented to extract raster information. They are then imbedded in the query executer to process a query of the raster information. Simulation results are given.

• Journal of Cadastre & Land InformatiX
• /
• v.51 no.2
• /
• pp.5-20
• /
• 2021

With the available national spatial information that started from the sinkholes that occurred nationwide in 2014 and integrated 15 areas of underground information, the Underground Spatial Integrated Map has been continuously maintained since 2015. However, until recently, as disasters and accidents in underground spaces such as hot water pipes rupture, cable tunnel fires, and ground subsidence continue to occur, there is an increasing demand for quality improvement of underground information. Thus, this paper attempted to prepare a plan to improve the quality of the Underground Spatial Integrated Map data. In particular, among the 15 types of underground information managed through the Underground Spatial Integrated Map, quality validation improvement measures were proposed for underground facility (structure-type) data, which has the highest proportion of new constructions. To improve the current inspection methods that primarily rely on visual inspection, we elaborate on and subdivide the current quality inspection standards. Specifically, we present an approach for software-based automated inspection of databases, including graphics and attribute information, by adding three quality inspection items, namely, quality inspection methods, rules, and flow diagram, solvable error types, to the current four quality inspection items consisting of quality elements, sub-elements, detailed sub-elements, and quality inspection standards.