Learn More
An algorithm is presented for finding the <i>k</i> nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shortest paths between all possible vertices in the network and then making use of an encoding that takes advantage of the fact that the shortest paths from vertex <i>u</i> to all(More)
A framework for determining the shortest path and the distance between every pair of vertices on a spatial network is presented. The framework, termed SILC, uses <i>path coherence</i> between the shortest path and the spatial positions of vertices on the spatial network, thereby, resulting in an encoding that is compact in representation and fast in path(More)
Costly props, complicated authoring technologies, and limited access to space are among the many reasons why children can rarely enjoy the experience of authoring room-sized interactive stories. Typically in these kinds of environments, children are restricted to being story participants, rather than story authors. Therefore, we have begun the development(More)
Numerous federal agencies produce official statistics made accessible to ordinary citizens for searching and data retrieval. This is frequently done via the Internet through a Web browser interface. If this data is presented in textual format, it can often be searched and retrieved by such attributes as topic, responsible agency, keywords, or press release.(More)
The result of a distance join operation on two sets of objects <i>R, S</i> on a spatial network <i>G</i> is a set <i>P</i> of object pairs <i>pq</i>, <i>p &#201; R</i>, <i>q &#201; S</i> such that the distance of an object pair <i>pq</i> is the shortest distance from <i>p</i> to <i>q</i> in <i>G</i>. Several variations to the distance join operation such as(More)
Children enjoy interactive museum experiences, fun houses, and amusement parks, but children are not the authors of these immersive storytelling experiences. They are merely the audience or participants in an environment built by adults. We believe an important educational opportunity is being overlooked. Therefore, we have developed what we call a(More)
A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to García et al. [Y. which is known as the top-down greedy split (TGS) bulk loading algorithm. The TGS algorithm makes use of a classical bottom-up packing approach. In addition, an alternative packing approach termed top-down packing is(More)
  • 1