We present a general approach for analyzing structural parameters of a relational event graph within arbitrary query time intervals using colored range query data structures. Relational event graphs generally represent social network datasets, where each graph edge carries a timestamp. We provide data structures based on colored range searching to efficiently compute several graph parameters (e...

In order to realize more precise geometrical models of existing buildings, range images are used to represent the geometrical information of the façades of existing buildings. First, the range images of existing buildings are acquired using laser scanners mounted on a data acquisition vehicle which runs along the street. After removing obstacles, edge detection based segmentation and histogram ...

In this paper we discuss some design issues concerning a semi-dynamic data structure for searching in multidimensional point sets in distributed environments. The data structure is based on an extension of k-d trees and supports exact, partial, and range search queries. We assume multicast is available in our distributed environment, but discuss how to use it only when needed and investigate, t...