geometry algorithm

From: "laura" <laura.brandusan@xxxxxxxxx>
Date: 1 May 2006 02:06:02 -0700

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

.

Follow-Ups:
- Re: geometry algorithm
  - From: waveletter
- Re: geometry algorithm
  - From: William Elliot

Prev by Date: Re: Need help to answer a boy genius.
Next by Date: Re: Where is the paradox in liar?
Previous by thread: [FAQ, 99/07/28] Mathematical logic on the web
Next by thread: Re: geometry algorithm
Index(es):
- Date
- Thread

Relevant Pages

Re: geometry algorithm
... I have 2 concave polygons and I need a way to match them so that the ... Are there any fast algorithms for this problem? ... complexity is not always the enemy." ... -- Larry Wall ...
(comp.lang.c)
geometry algorithm
... I have 2 concave polygons and I need a way to match them so that the ... surrounding rectangle is minimal. ... Are there any fast algorithms for this problem? ... What about the case when the polygons are convex? ...
(comp.lang.c)
geometry algorithm
... I have 2 concave polygons and I need a way to match them so that the ... surrounding rectangle is minimal. ... Are there any fast algorithms for this problem? ... What about the case when the polygons are convex? ...
(sci.math)
geometry algorithm
... I have 2 concave polygons and I need a way to match them so that the ... surrounding rectangle is minimal. ... Are there any fast algorithms for this problem? ... What about the case when the polygons are convex? ...
(comp.theory)
geometry algorithm
... I have 2 concave polygons and I need a way to match them so that the ... surrounding rectangle is minimal. ... Are there any fast algorithms for this problem? ... What about the case when the polygons are convex? ...
(comp.lang.c)