By Topic

Reversibility of the Quad-Edge operations in the Voronoi data structure

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
$33 $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

4 Author(s)
Darka Mioc ; University of New Brunswick, Canada ; Francois Anton ; Christopher M. Gold ; Bernard Moulin

In geographic information systems the reversibility of map update operations have not been explored yet. In this paper we are using the Voronoi based quad-edge data structure to define reversible map update operations. The reversibility of the map operations have been formalised at the lowest level, as the basic algorithms for addition, deletion and moving of spatial objects. Having developed reversible map operations on the lowest level, we were able to maintain reversibility of the map updates at higher level as well. The reversibility in GIS can be used for efficient implementation of rollback mechanisms and dynamic map visualisations.

Published in:

Voronoi Diagrams in Science and Engineering, 2007. ISVD '07. 4th International Symposium on

Date of Conference:

9-11 July 2007