Loading...
Search for:
polar-diagrams
0.009 seconds
Polar diagram of moving objects
, Article 20th Annual Canadian Conference on Computational Geometry, CCCG 2008, Montreal, QC, 13 August 2008 through 15 August 2008 ; August , 2008 , Pages 51-54 ; Ghodsi, M ; Sharif University of Technology
2008
Abstract
Many important problems in Computational Geometry needs to perform some kind of angle processing. The Polar Diagram [4] is a locus approach for problems processing angles. Using this structure as preprocessing, one can eliminate exhaustive searches to find objects with smallest angle. Handling data in change is a significant concept in Computer Science. One of the design and analysis tools used in the modeling of moving geometric objects is the kinetic data structure (or KDS) framework Kinetic Data Structure is a framework for maintaining a certain attribute of a set of objects while moving in a continuous manner. In this paper, we use the notion of kinetic data structure to model the...
Kinetic polar diagram
, Article 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) ; Chitforoush, F ; Yazdandoost, M ; Ghodsi, M ; Sharif University of Technology
2008
Abstract
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