Learn More
From an initial triangle, three triangles are obtained joining the two equally spaced points of the longest-edge with the opposite vertex. This construction is the base of the longest-edge trisection method. Let D be an arbitrary triangle with minimum angle a. Let D 0 be any triangle generated in the iterated application of the longest-edge trisection. Let(More)
In this note, by using complex variable functions, we present a new simpler proof of the degeneracy property of the longest-edge n-section of triangles for n P 4. This means that the longest-edge n-section of triangles for n P 4 produces a sequence of triangles with minimum interior angle converging to zero. Unstructured mesh generation and adaptive mesh(More)
The Longest-Edge (LE) trisection of a triangle is obtained by joining the two points which divide the longest edge in three with the opposite vertex. If LE-trisection is iteratively applied to an initial triangle, then the maximum diameter of the resulting triangles is between two sharpened decreasing functions. This paper mathematically answers the(More)
Sixty-four strains ofRhizobium and seven other rhizosphere bacteria were evaluated by streak-plate, double-layer, and spent-culture methods to determine their antibiotic activity againstMacrophomina phaseolina, causative agent of 'ashy stem' blight of beans. Expression of inhibition varied among strains and depended on growth media and screening method. The(More)
  • 1