Binary spatial operations on cell complex using incidence graph implemented at a spatial database system Hawk Eye

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 spatia ld atabase 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 ne wa lgorithm 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.

[1]  L. Glaser Geometrical combinatorial topology , 1970 .

[2]  Sang Hun Lee,et al.  Partial entity structure: a compact non-manifold boundary representation based on partial topological entities , 2001, SMA '01.

[3]  Edwin H. Blake,et al.  Exact From-Region Visibility Culling , 2002, Rendering Techniques.

[4]  Valerio Pascucci,et al.  Splitting a complex of convex polytopes in any dimension , 1996, SCG '96.

[5]  Steven Skiena,et al.  Implementing discrete mathematics - combinatorics and graph theory with Mathematica , 1990 .

[6]  Peter Z. Revesz,et al.  Introduction to Constraint Databases , 2002, Texts in Computer Science.

[7]  A. Makinouchi,et al.  An extended cell splitting algorithm for spatial databases , 2004, 2004 IEEE Region 10 Conference TENCON 2004..

[8]  Hendrik C. Ferreira,et al.  Introduction to Constrained Binary Codes with Error Correction Capability , 2004 .

[9]  Stéphane Grumbach,et al.  The DEDALE system for complex spatial queries , 1998, SIGMOD '98.

[10]  Erik Brisson,et al.  Representing geometric structures in d dimensions: topology and order , 1989, SCG '89.

[11]  Max J. Egenhofer,et al.  A Formal Definition of Binary Topological Relationships , 1989, FODO.

[12]  Ale Raza,et al.  Cell tuple based spatio-temporal data model: an object oriented approach , 1999, GIS '99.

[13]  Jia Chen,et al.  The CCUBE Constraint Object-Oriented Database System , 1999, SIGMOD '99.

[14]  Michael F. Worboys,et al.  A Unified Model for Spatial and Temporal Information , 1994, Comput. J..

[15]  Erik Brisson,et al.  Representing geometric structures ind dimensions: Topology and order , 1993, Discret. Comput. Geom..

[16]  Leila De Floriani,et al.  A scalable data structure for three-dimensional non-manifold objects , 2003, Symposium on Geometry Processing.