Re: Biggest inscribing squares in a region

Christoph Bartoschek wrote:
Hi,

does anyone know an algorithm or a paper that describes an efficient
solution of the following problem:

Given is a set of rectilinear rectangles in the plane. For each point in the
union of the rectangles we search the size of the biggest square, such that
each point of the square is covered by at least one rectangle in the set.

Are you sure your question matches what you're trying to find? Why specify "For each point in the union of the rectangles" when "the biggest square, such that ..." is the same square for each such point?

--Mike Amling
.

Relevant Pages

  • Re: Biggest inscribing squares in a region
    ... the union of the rectangles we search the size of the biggest square, ... such that each point of the square is covered by at least one rectangle ...
    (sci.math)
  • Biggest inscribing squares in a region
    ... Given is a set of rectilinear rectangles in the plane. ... union of the rectangles we search the size of the biggest square, ...
    (sci.math)
  • Re: Biggest inscribing squares in a region
    ... Jon Haugsand wrote: ... rectangles is: ... For the top left point the biggest square has a side length of 6 units. ... However I guess I have developed an algorithm for this problem that is good ...
    (sci.math)
  • Re: Biggest inscribing squares in a region
    ... Christoph Bartoschek ... rectangles is: ... For the top left point the biggest square has a side length of 6 units. ... Jon Haugsand ...
    (sci.math)
  • Re: fmincon
    ... You are right,the size of the rectangles is limmited by the following: ... The goal is to lead the product of double integrals (of probability density,each over its union) to maximum. ... I'm rather don't catch something but it's strange: check the point is inside rectangle is implemented with two simple linear constraints but to constrain the opposite is something not so simple. ... It's pretty clear that in an optimal solution, the rectangles must all be touching each other and be as close as possible to the mode of the normal distribution. ...
    (comp.soft-sys.matlab)