sign in
english version rss feed

inria-00192927, version 1

Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint

Olivier Devillers () 1, Vida Dujmovic 2, Hazel Everett () 3, Samuel Hornus 4, Sue Whitesides 5, Steve Wismath 6

International Journal of Computational Geometry & Applications 17, 4 (2007) 297-304

Abstract: Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering information as q moves. In linear space, and after O(n log n) preprocessing time, our solution maintains the view at a cost of O(log n) amortized time (resp. O(log^2 n) worst case time) for each change. Our algorithm can also be used to maintain the set of points sorted according to their distance to q.

  • Domain : Computer Science/Computational Geometry
  • Keywords : visibility – dynamic data structures
 
  • inria-00192927, version 1
  • oai:hal.inria.fr:inria-00192927
  • From: 
  • Submitted on: Thursday, 29 November 2007 17:20:27
  • Updated on: Tuesday, 4 December 2007 20:32:38
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...