GeoTree: A Data Structure for Constant Time Geospatial Search Enabling a Real-Time Property Index

2021 ◽  
pp. 152-165
Author(s):  
Robert Miller ◽  
Phil Maguire
Keyword(s):  
Data Structure ◽  
Real Time ◽  
Constant Time ◽  
Time Property ◽  
Property Index

scholarly journals Graph-Based Construction of 3D Korean Giwa House Models

Buildings ◽  
2019 ◽  
Vol 9 (3) ◽  
pp. 68
Author(s):  
Mankyu Sung
Keyword(s):  
Data Structure ◽  
Computer Graphics ◽  
Real Time ◽  
Texture Image ◽  
Time Rate ◽  
Commercial Software ◽  
Spline Curve ◽  
High Level ◽  
Complicated Part ◽  
Different Parts

This paper proposes a graph-based algorithm for constructing 3D Korean traditional houses automatically using a computer graphics technique. In particular, we target designing the most popular traditional house type, a giwa house, whose roof is covered with a set of Korean traditional roof tiles called giwa. In our approach, we divided the whole design processes into two different parts. At a high level, we propose a special data structure called ‘modeling graphs’. A modeling graph consists of a set of nodes and edges. A node represents a particular component of the house and an edge represents the connection between two components with all associated parameters, including an offset vector between components. Users can easily add/ delete nodes and make them connect by an edge through a few mouse clicks. Once a modeling graph is built, then it is interpreted and rendered on a component-by-component basis by traversing nodes in a procedural way. At a low level, we came up with all the required parameters for constructing the components. Among all the components, the most beautiful but complicated part is the gently curved roof structures. In order to represent the sophisticated roof style, we introduce a spline curve-based modeling technique that is able to create curvy silhouettes of three different roof styles. In this process, rather than just applying a simple texture image onto the roof, which is widely used in commercial software, we actually laid out 3D giwa tiles on the roof seamlessly, which generated more realistic looks. Through many experiments, we verified that the proposed algorithm can model and render the giwa house at a real time rate.

A Real-Time Property Value Index Based on Web Data

2014 ◽  
pp. 273-297 ◽  
Author(s):  
M.J. Bárcena ◽  
P. Menéndez ◽  
M.B. Palacios ◽  
F. Tusell
Keyword(s):  
Real Time ◽  
Property Value ◽  
Web Data ◽  
Time Property

scholarly journals A Data Structure for Real-Time Aggregation Queries of Big Brain Networks

2019 ◽  
Vol 18 (1) ◽  
pp. 131-149
Author(s):  
Florian Johann Ganglberger ◽  
Joanna Kaczanowska ◽  
Wulf Haubensak ◽  
Katja Bühler
Keyword(s):  
Data Structure ◽  
Real Time ◽  
Brain Networks ◽  
Time Aggregation ◽  
Aggregation Queries

Design and Implementation of Digital Television Closed Caption

2014 ◽  
Vol 667 ◽  
pp. 201-207
Author(s):  
Qi Deng ◽  
Pin Xu ◽  
Shao Bin Li ◽  
Xin Yao Zhang
Keyword(s):  
Data Structure ◽  
Real Time ◽  
Xml Schema ◽  
Digital Television ◽  
Television System ◽  
The Real ◽  
Design And Implementation ◽  
Technology Standard ◽  
Real Time Transmission ◽  
Representation Method

In China, closed caption is the latest technology standard separating the caption from the image. In current digital television system, it is an urgent issue to be resolved that how to implement the real-time transmission of closed caption with its host video. This paper proposed a kind of closed caption and its representation method. It also designed a closed caption data structure based on XML and provided a solution about how to package XML file and XML Schema file into MXF files.

scholarly journals AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS

1999 ◽  
Vol 09 (01) ◽  
pp. 29-38
Author(s):  
MIKHAIL J. ATALLAH
Keyword(s):  
Data Structure ◽  
Constant Time ◽  
Search Problem ◽  
Parallel Search ◽  
Point Location ◽  
Planar Point ◽  
Geometric Problems ◽  
Trapezoidal Decomposition ◽  
Planar Point Location ◽  
Hypercube Model

We give a result that implies an improvement by a factor of log log  n in the hypercube bounds for the geometric problems of batched planar point location, trapezoidal decomposition, and polygon triangulation. The improvements are achieved through a better solution to the multisearch problem on a hypercube, a parallel search problem where the elements in the data structure S to be searched are totally ordered, but where it is not possible to compare in constant time any two given queries q and q′. Whereas the previous best solution to this problem took O( log  n( log log  n)3) time on an n-processor hypercube, the solution given here takes O( log  n( log log  n)2) time on an n-processor hypercube. The hypercube model for which we claim our bounds is the standard one, SIMD, with O(1) memory registers per processor, and with one-port communication. Each register can store O( log  n) bits, so that a processor knows its ID.

A Load Balancing Mechanism Using Bloom Filter in Storm System

2014 ◽  
Vol 543-547 ◽  
pp. 1972-1976
Author(s):  
Huai Lin Dong ◽  
Ming Yuan He ◽  
Qing Feng Wu ◽  
Sheng Hang Wu
Keyword(s):  
Data Structure ◽  
Load Balancing ◽  
Real Time ◽  
Data Transmission ◽  
Streaming Media ◽  
Bloom Filter ◽  
Time System ◽  
Real Time System ◽  
Membership Queries ◽  
Probabilistic Data Structure

When membership queries are evaluated in a set, the performance can be improved by a Bloom filter which is a space-efficient probabilistic data structure. According to its space-efficient character, Bloom Filter presented to address the load balancing problem for streaming media information in Storm system which is free and open source distributed real time computation system. This method increases the server cluster availability by balancing the workloads among the servers within a cluster. Additionally, it improves real time system Storm efficiently in saving the data transmission time and reducing the calculation complexity.

Sign in / Sign up

Export Citation Format

Share Document