The expected length of a random line segment in a rectangle

2004 ◽  
Vol 32 (2) ◽  
pp. 99-102 ◽  
Author(s):  
Eric Rosenberg
Author(s):  
Ke Shang ◽  
Tao Lei ◽  
Quan Wang ◽  
Yu Zhang ◽  
Hao Zhang ◽  
...  

2020 ◽  
Author(s):  
Anna Nowakowska ◽  
Alasdair D F Clarke ◽  
Jessica Christie ◽  
Josephine Reuther ◽  
Amelia R. Hunt

We measured the efficiency of 30 participants as they searched through simple line segment stimuli and through a set of complex icons. We observed a dramatic shift from highly variable, and mostly inefficient, strategies with the line segments, to uniformly efficient search behaviour with the icons. These results demonstrate that changing what may initially appear to be irrelevant, surface-level details of the task can lead to large changes in measured behaviour, and that visual primitives are not always representative of more complex objects.


2021 ◽  
Vol 113 ◽  
pp. 107834
Author(s):  
Yongjun Zhang ◽  
Dong Wei ◽  
Yansheng Li
Keyword(s):  

2014 ◽  
Vol 602-605 ◽  
pp. 3104-3106
Author(s):  
Shao Hua Liu ◽  
Jia Hua Zhang

This paper introduced points and directed line segment relation judgment method, the characteristics of generation and Graham method using the original convex hull generation algorithm of convex hull discrete points of the convex hull, an improved algorithm for planar discrete point set is proposed. The main idea is to use quadrilateral to divide planar discrete point set into five blocks, and then by judgment in addition to the four district quadrilateral internally within the point is in a convex edge. The result shows that the method is relatively simple program, high computational efficiency.


Sign in / Sign up

Export Citation Format

Share Document