Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Selection for visualization: Voronoi tessellation of large scale and sparsely distributed data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhengxu Zhao ; Sch. of Comput., Univ. of Derby, Derby ; Jinsheng Fan

Visualizing data specifically selected among a large scale and sparsely distributed database can often be instantaneous and has to be low complexity in computation, especially when simulation process is involved. This article presents a novel method of selection for visualization. It uses Voronoi tessellation to decompose the database into Voronoi data cells, then it adapts the Point Location and the Nearest Neighbor Searching algorithms to reduce data search time over the large data set so that visualization and simulation can be instantaneously realized. The method is successfully implemented in large scale and complex virtual environment systems and is tested with applications in satellite tracking and controls.

Published in:

Advanced Intelligent Mechatronics, 2008. AIM 2008. IEEE/ASME International Conference on

Date of Conference:

2-5 July 2008