Geometry and Graphics of informational
    
    
  
  
  
      
      
      
        
Trudy Geometricheskogo Seminara, Trudy Geometricheskogo Seminara, Tome 24 (2003), pp. 17-30
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			The present paper is devoted to a geometric approach to the problems
on dynamical search for moving objects. We construct time-dependent
sets determined by distribution of information between the conflicting
objects, and give basic examples of informational sets. We suggest a numerical
method for constructing an approximation of informational sets
which preserves their basic properties, and apply this method to finding
the search trajectory for an object moving in a monotonic polygon.
			
            
            
            
          
        
      @article{KUTGS_2003_24_a3,
     author = {S. B. Berezin and E. V. Shikin},
     title = {Geometry and {Graphics} of informational},
     journal = {Trudy Geometricheskogo Seminara},
     pages = {17--30},
     publisher = {mathdoc},
     volume = {24},
     year = {2003},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/KUTGS_2003_24_a3/}
}
                      
                      
                    S. B. Berezin; E. V. Shikin. Geometry and Graphics of informational. Trudy Geometricheskogo Seminara, Trudy Geometricheskogo Seminara, Tome 24 (2003), pp. 17-30. http://geodesic.mathdoc.fr/item/KUTGS_2003_24_a3/
