Re: geometry algorithm

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>

.

Relevant Pages

  • 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? ...
    (sci.logic)
  • 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)