Data structures and algorithm analysis in C (2nd ed.)
Data structures and algorithm analysis in C (2nd ed.)
I/O optimal isosurface extraction (extended abstract)
VIS '97 Proceedings of the 8th conference on Visualization '97
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
On deletion in Delaunay triangulations
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Interactive Computer Graphics
3d Computer Graphics with Cdrom
3d Computer Graphics with Cdrom
Speeding Up Isosurface Extraction Using Interval Trees
IEEE Transactions on Visualization and Computer Graphics
Relaxed Balance through Standard Rotations
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Digital Elevation Models and TIN Algorithms
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
Delete and insert operations in Voronoi/Delaunay methods and applications
Computers & Geosciences
OpenGL Programming Guide: The Official Guide to Learning OpenGL, Version 1. 4
OpenGL Programming Guide: The Official Guide to Learning OpenGL, Version 1. 4
Embedded networked sensing systems: motivations and challenges
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Beyond average: toward sophisticated sensing with queries
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
| Hi-index | 0.00 |
Queries over streaming data offer the potential to provide timely information for modern database applications, such as sensor networks and web services. Isoline-based visualization of streaming data has the potential to be of great use in such applications. Dynamic (real-time) isoline extraction from the streaming data is needed in order to fully harvest that potential, allowing the users to see in real time the patterns and trends – both spatial and temporal – inherent in such data. This is the goal of this paper. Our approach to isoline extraction is based on data terrains, triangulated irregular networks (TINs) where the coordinates of the vertices corresponds to locations of data sources, and the height corresponds to their readings. We dynamically maintain such a data terrain for the streaming data. Furthermore, we dynamically maintain an isoline (contour) map over this dynamic data network. The user has the option of continuously viewing either the current shaded triangulation of the data terrain, or the current isoline map, or an overlay of both. For large networks, we assume that complete recomputation of either the data terrain or the isoline map at every epoch is impractical. If n is the number of data sources in the network, time complexity per epoch should be O(logn) to achieve real-time performance. To achieve this time complexity, our algorithms are based on efficient dynamic data structures that are continuously updated rather than recomputed. Specifically, we use a doubly-balanced interval tree, a new data structure where both the tree and the edge sets of each node are balanced. As far as we know, no one has applied TINs for data terrain visualization before this work. Our dynamic isoline computation algorithm is also new. Experimental results confirm both the efficiency and the scalability of our approach.