In article
<9130961.1209046212624.JavaMail.jakarta@[EMAIL PROTECTED]
>,
misty <luthien18@[EMAIL PROTECTED]
> wrote:
> hi,
> i've got such a problem. imagine a curve-partly linear, partly
non-linear. it
> can be for example part of a circle like ')' or like '(' or like 'U'.
> what i need is to write fully automatic algorithm that will find left
and
> right end-points of the curve. as You can see i cannot do for ex. find
min(x)
> and then find y where x is min. it will be good for ')', but what if the
> curve is like '('.
> also my points are not in order, i mean that x(1), y(1) is not the left
> end-point of the curve and x(end), y(end) is not the right end-point.
>
> can anyone suggest me something?
I suggest that the problem as stated, with an unordered set of points,
has no solution.
Consider the following 4 points (use a monospaced font):
* *
* *
They could represent several *different* connected curves, such as:
*---* * *
| or | |
*---* *---*
--
---------------------------
| BBB b \ Barbara at LivingHistory stop co stop uk
| B B aa rrr b |
| BBB a a r bbb | Quidquid latine dictum sit,
| B B a a r b b | altum viditur.
| BBB aa a r bbb |
-----------------------------
|
