Home/ Questions/Q 5963907
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-22T19:20:12+00:00

This is a city planning problem. I’m trying to order some rectangular buildings of

  • 0

This is a city planning problem.

I’m trying to order some rectangular buildings of given size within a lot, so that the building corners are always within a max distance D to the other buildings and that there is as little “wasted” space as possible.

Is there a close-packing algorithm I can use for this purpose? Is the Voronai-algorithm in some form applicable?

Thank you for your consideration.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    This requirement

    building corners are always within a
    max distance D to the other buildings

    can be modfied by increasing the outer bounds of each rectangle by an edge of width D/2. This leaves you with a standard 2D Strip packing problem. Here

    http://www.devx.com/dotnet/Article/36005

    you find a nice article how to attack those kind of problems, sample programs (C#, VB.NET) included. Here is a Wikipedia article

    http://en.wikipedia.org/wiki/Bin_packing_problem

    which may help you a little bit, too.

    • 0