Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

COCOON

1998

Springer

1998

Springer

Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n colored points in IRD , where D 2 is a constant, and a subset S S stored in a CSST, for any colored query point q IRD a nearest foreign neighbor in S , i.e. a closest point with a different color, can be reported in O(log n(log log n)D-1 ) time w.r.t. a polyhedral distance function that is defined by a star-shaped polyhedron with O(1) vertices; note that this includes the Minkowski metrics d1 and d. It takes a preprocessing time of O(n(log n)D-1 ) to construct the CSST. Points from S can be inserted into the set S and removed from S in O(log n(log log n)D-1 ) time. The CSST uses O(n(log n)D-1 ) space. We present an application of the data structure in the parallel simulation of solute transport in aquifer systems by particle tracking. Other applications may be found in GIS (geo information systems) and in CAD...

Related Content

Added |
06 Aug 2010 |

Updated |
06 Aug 2010 |

Type |
Conference |

Year |
1998 |

Where |
COCOON |

Authors |
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan |

Comments (0)