Loading...

Kinetic polar diagram

Nouri Bygi, M ; Sharif University of Technology | 2008

283 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-89985-3_35
  3. Publisher: 2008
  4. Abstract:
  5. Polar Diagram [4] is a new locus approach for problems processing angles. The solution to many important problems in Computational Geometry requires some kind of angle processing of the data input. Using the Polar Diagrma as preprocessing, exhaustive searches to find those sites with smallest angle become unnecessary. In this paper, we use the notion of kinetic data structure [1][2] to model the dynamic case of polar diagram, i.e we maintain the polar diagram of a set of continuously moving objects in the scene. We show that our proposed structure meets the main criteria of a good KDS. © 2008 Springer-Verlag
  6. Keywords:
  7. Data input ; Exhaustive search ; Geometric events ; Kinetic data structure ; Kinetic data structures ; Moving objects ; Polar diagrams ; Computer science ; Data processing ; Data structures ; Computational geometry
  8. Source: 13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008, Kish Island, 9 March 2008 through 11 March 2008 ; Volume 6 CCIS , 2008 , Pages 283-290 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007%2F978-3-540-89985-3_35