Re: geometry algorithm
- From: William Elliot <marsh@xxxxxxxxxxxxxxxxxx>
- Date: Mon, 1 May 2006 03:44:14 -0700
On Mon, 1 May 2006, laura wrote:
Dear all,I think you've a problem knowing how to state it.
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 theOk, you've two concave polygons and you want to match them.
surrounding rectangle is minimal (has a minimal surface).
But aren't they already a matched pair?
Then you want a minimal area surrounding rectangle.
Around what, around both polygons?
Hm, you've two (not over lapping) concave polygons and you want to move
them around or place (including flipping over) them without over lapping,
so that a (closed) rectangle containing them can have the smallest area of
all rectangles that contain them however they are placed.
Are there any fast algorithms for this problem?
No, they're aren't any fast algorithms for translating quickspeak
nothink. You need to explain your match making method. However,
one quickly sees that matching by placing on top of will greatly
diminish the size of any surrounding rectangle. So that's the
answer, the fastest way is to place one on top of the other.
What about the case when the polygons are convex?Naw, best to consider is the hetero problem,
one concave and the other convex.
.
- Follow-Ups:
- Re: geometry algorithm
- From: laura
- Re: geometry algorithm
- References:
- geometry algorithm
- From: laura
- geometry algorithm
- Prev by Date: Re: Where is the paradox in liar?
- Next by Date: Re: Where is the paradox in liar?
- Previous by thread: geometry algorithm
- Next by thread: Re: geometry algorithm
- Index(es):
Relevant Pages
|
