| |
Online ISSN:1349-8606 |
| Progress in Informatics |
|
| No.3 April 2006 |
|
| Page 19-30 |
PDF(1,037KB) | References |
| doi:10.2201/NiiPi.2006.3.3 |
| Binary spatial operations on cell complex using incidence graph implemented at a spatial database system Hawk Eye |
| Kunihiko KANEKO1, Akifumi MAKINOUCHI1 |
|
1 Kyushu University
|
(Received: February 23, 2006)
(Revised: April 7, 2006)
(Accepted: May 12, 2006)
|
Abstract:
We implemented a spatial database system called Hawk Eye for three- and four-dimensional modeling applications, such as solid modeling, computer simulation and computer vision. Spatial query and manipulation are important system functions for retrieving and analyzing spatial objects. Binary spatial operations are necessary in order to respond to spatial queries and manipulations. Efficient processing of binary spatial operations between two cell complexes is important with respect to a cell-complex-based spatial database because the evaluation of these operations by previous algorithms is time-consuming. We present a new algorithm called the Cell Splitting and Merge Algorithm (CSMA) to evaluate binary spatial operations between two cell complexes. The new algorithm is efficient for cell complexes of three or four dimensions. Key to the algorithm is the use of an incidence graph of the cell complex.
|
Keywords:
Spatial database, spatial query processing, cell complex, cell splitting, cell splitting and merge algorithm
|
|
|
| PDF(1,037KB) | References |
National Institute of Informatics is a member of CrossRef.
|
