geometry algorithm

[laura]

Dear all,

I have a problem and I don't know how to solve it:

I have 2 concave polygons and I need a way to match them so that the
surrounding rectangle is minimal (has a minimal surface).

Are there any fast algorithms for this problem?
What about the case when the polygons are convex?

Thanks,
Laura

 

[Vladimir Oka]

laura opined:

Dear all,

I have a problem and I don't know how to solve it:

I have 2 concave polygons and I need a way to match them so that the
surrounding rectangle is minimal (has a minimal surface).

Are there any fast algorithms for this problem?
What about the case when the polygons are convex?

This question is really an algorithm one, best suited for
comp.programming

Should you get stuck implementing it in C, do come back here.

Followups-to set...

--
"However, complexity is not always the enemy."

-- Larry Wall (Open Sources, 1999 O'Reilly and Associates)

<http://clc-wiki.net/wiki/Introduction_to_comp.lang.c>

 

[Default User]

Vladimir Oka wrote:

This question is really an algorithm one, best suited for
comp.programming

Should you get stuck implementing it in C, do come back here.

Followups-to set...

I've mentioned this before, but don't set follow-ups on a message
unless you've cross-posted the message containing the original problem
and your reason for setting the follow-up. Otherwise, replies start
dropping into the new group without any notice of where they came from,
and no history for that group to backtrack.

It is EXTREMELY rude to the other group.

My recommendation is to give the redirection and leave it to the OP to
repost the message.



Brian

 

[Vladimir Oka]

Default User opined:

Vladimir Oka wrote:



I've mentioned this before, but don't set follow-ups on a message
unless you've cross-posted the message containing the original
problem and your reason for setting the follow-up.

Ooops, though I did that. Will be more careful...

My recommendation is to give the redirection and leave it to the OP
to repost the message.

Yes, a much better idea (and actually easier, too).

Thanks.


--
"However, complexity is not always the enemy."

-- Larry Wall (Open Sources, 1999 O'Reilly and Associates)

<http://clc-wiki.net/wiki/Introduction_to_comp.lang.c>