inria-00192927, version 1
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint
Olivier Devillers
1Vida Dujmovic 2Hazel Everett
3Samuel Hornus 4Sue Whitesides 5Steve 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.
- 1: GEOMETRICA (INRIA Sophia Antipolis)
- INRIA
- 2: Department of Mathematics and Statistics [Mac Gill]
- Mac Gill University
- 3: VEGAS (INRIA Lorraine - LORIA)
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- 4: ARTIS (INRIA Grenoble Rhône-Alpes / LJK Laboratoire Jean Kuntzmann)
- CNRS : FR71 – INRIA – Laboratoire Jean Kuntzmann – CNRS : UMR5224 – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG)
- 5: School of Computer Science [Quebec] (SOCS)
- McGill University
- 6: Department of Mathematics and Computer Science
- University of Lethbridge
- Domain : Computer Science/Computational Geometry
- Keywords : visibility – dynamic data structures
- inria-00192927, version 1
- http://hal.inria.fr/inria-00192927
- oai:hal.inria.fr:inria-00192927
- From: Olivier Devillers
- Submitted on: Thursday, 29 November 2007 17:20:27
- Updated on: Tuesday, 4 December 2007 20:32:38






Associated documents
Export