scholarly journals On Some Remarkable Points and Line Segments in Triangles

2021 ◽  
pp. 106-111
Author(s):  
Yu.N. Maltsev ◽  
A.S. Monastyreva

Let ra, rb, rc be the radii, and OA, OB, OC the centers of tangent circles at the vertices to the circumcircle of a triangle ABC and to the opposite sides. In the paper [Andrica D., Marinescu D.S. New interpolation inequalities to Euler's R≥2 // Forum Geometricorum. 2017. Vol. 17], the authors proved that 4/R £ 1/ra + 1/rb +1/rc £2/r. In the paper [Isaev I., Maltsev Yu., Monastyreva A. On some relations in geometry of a triangle // Journal of Classical Geometry. 2018. Vol. 4], it is given the following generalization of these inequalities: 1/ra + 1/rb +1/rc=2/R+1/r. In that paper, we find the area of the triangle OAOBOC (see Theorem 1). We prove some relations for the numbers R-ra, R-rb, R-rc, where R is the circumradius of a triangle ABC. Namely, we find the expressions 1/R-ra+1/R-rb + 1/R-rc  и a/R-ra+b/R-rb + c/R-rc by means by the parameters p, R and r (see Theorem 2). We estimate these values (see Theorem 3). Finally, using the results of paper [Maltsev Yu., Monastyreva A. On some relations for a triangle // International Journal of Geometry. 2019. Vol. 8 (1)] and representing the expression of (1-cos(αβ))(1-cos(β-γ))(1-cos(α-γ)) by means of p, R, r, we prove new proof of the fundamental triangle inequality (see Corollary 2).

1982 ◽  
Vol 89 (2) ◽  
pp. 123-154 ◽  
Author(s):  
Amos Tversky ◽  
Itamar Gati
Keyword(s):  

2009 ◽  
Author(s):  
Robert G. Cook ◽  
Carl Erick Hagmann
Keyword(s):  

2014 ◽  
Vol 13 (1) ◽  
pp. 4127-4145
Author(s):  
Madhushi Verma ◽  
Mukul Gupta ◽  
Bijeeta Pal ◽  
Prof. K. K. Shukla

Orienteering problem (OP) is an NP-Hard graph problem. The nodes of the graph are associated with scores or rewards and the edges with time delays. The goal is to obtain a Hamiltonian path connecting the two necessary check points, i.e. the source and the target along with a set of control points such that the total collected score is maximized within a specified time limit. OP finds application in several fields like logistics, transportation networks, tourism industry, etc. Most of the existing algorithms for OP can only be applied on complete graphs that satisfy the triangle inequality. Real-life scenario does not guarantee that there exists a direct link between all control point pairs or the triangle inequality is satisfied. To provide a more practical solution, we propose a stochastic greedy algorithm (RWS_OP) that uses the roulette wheel selectionmethod, does not require that the triangle inequality condition is satisfied and is capable of handling both complete as well as incomplete graphs. Based on several experiments on standard benchmark data we show that RWS_OP is faster, more efficient in terms of time budget utilization and achieves a better performance in terms of the total collected score ascompared to a recently reported algorithm for incomplete graphs.


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.


2009 ◽  
Vol 29 (5) ◽  
pp. 1359-1361
Author(s):  
Tong ZHANG ◽  
Zhao LIU ◽  
Ning OUYANG

2021 ◽  
Vol 79 (2) ◽  
pp. 503-520
Author(s):  
Ignacio Araya ◽  
Damir Aliquintui ◽  
Franco Ardiles ◽  
Braulio Lobo

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 25554-25578
Author(s):  
Onofre Martorell ◽  
Antoni Buades ◽  
Jose Luis Lisani

Sign in / Sign up

Export Citation Format

Share Document