• Spatial Information Research
• /
• v.18 no.5
• /
• pp.93-105
• /
• 2010

Spatial neighborhoods are spaces which are relate to target space. A 3D spatial query which is a function for searching spatial neighborhoods is a significant function in spatial analysis. Various methodologies have been proposed in related these studies, this study suggests an adjacent based methodology. The methodology of this paper implements topological data for represent a adjacency via using network based topological data model, then apply modifiable Dijkstra's algorithm to each topological data. Results of ordering analysis about an adjacent space from a target space were visualized and considered ways to take advantage of. Object of this paper is to implement a 3D spatial query for searching a target space with a adjacent relationship in 3D space. And purposes of this study are to 1)generate adjacency based 3D network data via network based topological data model and to 2)implement a 3D spatial query for searching spatial neighborhoods by applying Dijkstra's algorithms to these data.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.27-29
• /
• 2000

지리정보시스템은 지리적으로 관련된 정보를 효율적으로 저장, 변경, 관리 및 분석을 위한 시스템으로서 하드웨어, 소프트웨어, 지리 데이터 등으로 구성되어 있다. 지리정보시스템은 일반적인 데이터베이스의 연산과 공간정보를 이용한 분석 기능을 통합한 시스템으로서 응용 범위 또한 매우 다양하다. 이 논문에서는 지리정보시스템의 2차원 및 3차원 질의 처리를 위한 2차원 및 3차원 공간 질의어, 그 질의처리 및 최적화에 대해 보인다.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.383-393
• /
• 2005

Retrieval of images from image databases by spatial relationship can be effectively performed through visual interface systems. In these systems, the representation of image with 2D strings, which are derived from symbolic projections, provides an efficient and natural way to construct image index and is also an ideal representation for the visual query. With this approach, retrieval is reduced to matching two symbolic strings. However, using 2D-string representations, spatial relationships between the objects in the image might not be exactly specified. Ambiguities arise for the retrieval of images of 3D scenes. In order to remove ambiguous description of object spatial relationships, in this paper, images are referred by considering spatial relationships using the spatial location algebra for the 3D image scene. Also, we remove the repetitive spatial relationships using the several reduction rules. A reduction mechanism using these rules can be used in query processing systems that retrieve images by content. This could give better precision and flexibility in image retrieval.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.301-310
• /
• 2013

The aim of the present study is to enhance query speed of large 3D point cloud indexed in octree by parallel query using multi-cores. Especially, it is focused on developing methods of accessing multiple leaf nodes in octree concurrently to query points residing within a radius from a given coordinates. To the end, two parallel query methods are suggested using different strategies to distribute query overheads to each core: one using automatic division of 'for routines' in codes controlled by OpenMP and the other considering spatial division. Approximately 18 million 3D points gathered by a terrestrial laser scanner are indexed in octree and tested in a system with a 8-core CPU to evaluate the performances of a non-parallel and the two parallel methods. In results, the performances of the two parallel methods exceeded non-parallel one by several times and the two parallel rivals showed competing aspects confronting various query radii. Parallel query is expected to be accelerated by anticipated improvements of distribution strategies of query overhead to each core.

• Spatial Information Research
• /
• v.15 no.2
• /
• pp.95-109
• /
• 2007

Recently people have been offered location based services on road networks. The navigation system, one of applications, serves to find the nearest gas station or guide divers to the shortest path based 2D map. However 3D map is more important media than 2D map to make sense friendly for the real. Although 3D map's data size is huge, portable devices' storage space is small. In this paper, we define continuous perspective queries to support 3D map to mobile user on road networks and propose this queries processing method.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.04a
• /
• pp.375-382
• /
• 2004

Lately, 3D GIS begins to be widely used in many application fields. In this research, we proposed a survey and analysis result of research trends for 3D GIS technologies-acquisition of 3D spatial data, 3D features structuring, 3D visualization, data query, and transmission etc. The result is expected to give the helpful information for constructing research road-map on development of 3D GIS technologies.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.32 no.5
• /
• pp.481-486
• /
• 2014

This study aims at enhancing the performance of file-referring octree, suggested by Han(2014), for efficiently querying huge 3D point clouds, acquired by the 3D terrestrial laser scanning. Han's method(2014) has revealed a problem of heavy declining in query speed, when if it was applied on a very long tunnel, which is the lengthy and narrow shaped anisometric structure. Hereupon, the shape of octree has been analyzed of its influence on the query efficiency with the testing method of generating an independent octree in each isometric subdivision of 3D object boundary. This method tested query speed and main memory usage against the conventional single octree method by capturing about 300 million points in a very long tunnel. Finally, the testing method resulted in which twice faster query speed is taking similar size of memory. It is also approved that the conclusive factor influencing the query speed is the destination level, but the query speed can still increase with more proximity to isometric bounding shape of octree. While an excessive unbalance of octree shape along each axis can heavily degrade the query speed, the improvement of octree shape can be more effectively enhancing the query speed than increasement of destination level.

• Spatial Information Research
• /
• v.13 no.2 s.33
• /
• pp.119-128
• /
• 2005

Most spatial data handled in GIS is two-dimensional. These two-dimensional data is established by selecting 2D aspects form 3D, or by projecting 3D onto 2D space. During this conversion, without user's intention, data are abstracted and omitted. This unwanted data loss causes disadvantages such as restrictingof the range of data application and describing inaccurate real world. Recently, three dimensional data is getting wide interests and demands. One of the examplesis Database Management System which can store and manage three dimensional spatial data. However, this DBMS does not support spatial query which is the essence of the database management system. So, various studies are needed in this field. This research designs spatial relationship that is defined in space database standard using the three-dimension space model. The spatial data model, which is used in this research, is the one defined in OGC for GMS3, and designing tool is DE-9IM based on Point-Set Topology blow as the best method for topological operation.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.281-292
• /
• 2004

Selectivity estimation for spatial query is very important process used in finding the most efficient execution plan. Many works have been performed to estimate accurate selectivity. Although they deal with some problems such as false-count, multi-count, they can not get such effects in little memory space. Therefore, we propose a new technique called MW Histogram which is able to compress summary data and get reasonable results and has a flexible structure to react dynamic update. Our method is based on two techniques : (a) MinSkew partitioning algorithm which deal with skewed spatial datasets efficiently (b) Wavelet transformation which compression effect is proven. The experimental results showed that the MW Histogram which the buckets and wavelet coefficients ratio is 0.3 is lower relative error than MinSkew Histogram about 5%-20% queries, demonstrates that MW histogram gets a good selectivity in little memory.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.157-167
• /
• 2003

Spatial relations among objects we one of the most frequently used searching criteria for a query based on the contents of 3-D images. However, the existing researches have mainly focused only the absolute directional relations based on a fixed viewpoint in 2-D images. So, this paper presents a representation method of viewpoint based directional relations that enables spatial relations among objects to be retrieved based on a viewpoint of an observer. The retrieval technique based on our method is a]so described. In this paper, the notion of 3D string is defined to express the spatial relations in a 3-D space. A retrieval method based on relative directional relations among objects from a viewpoint of an observer is also presented. The proposed method simplifies the retrieval of viewpoint-based directional relations because 2D+1D scheme reduces the dimension.