Given a digital curve and a maximum error, we propose an algorithm that computes a simplification of the curve such that the Fréchet distance between the original and the simplified curve is less than the error. The algorithm uses an approximation of the Fréchet distance, but a guarantee over the quality of the simplification is proved. Moreover, even if the theoretical complexity of the algori...

We construct the Seiberg–Witten curve for the E-string theory in six-dimensions. The curve is expressed in terms of affine E8 characters up to level 6 and is determined by using the mirror-type transformation so that it reproduces the number of holomorphic curves in the Calabi–Yau manifold and the amplitudes of N = 4 U(n) Yang–Mills theory on 12K3. We also show that our curve flows to known fiv...

sulphide was determined spectrophotometrically at 628 nm and ph 6.7 based on its catalytic reduction of toluidine blue in the presence of se(iv) using a flow injection system. after optimization of the measuring conditions the calibration curve was found linear up to 25 mg/ml and the detection limit was 0.3 mg/ml (30 ml injections). the relative standard deviation for the determination of 10 mg...

Let S be a set of n > 2 points in the plane whose convex hull has perimeter t. Given a number P ≥ t, we study the following problem: Of all curves of perimeter P that enclose S, which is the curve that encloses the maximum area? In this paper, we give a complete characterization of this curve. We show that there are cases where this curve cannot be computed exactly and provide an O(n logn)-time...