Databases
StackOverflow2013
Postsdbo
POBest nesting algorithm
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POBest nesting algorithm
    primarykey
    data
    text
    <p>I have spent time looking for information on the best algorithm to create a nesting of irregular polygons in 2D using manual and automatic positioning. I need to use such an algorithm in the context of CAD/CAM software. Here are the real possibilities I've found so far:</p> <ul> <li><p><strong>Separating Axis Theorem</strong>: is a fairly quick and simple algorithm to implement, but the drawback I find with it is that it only works with convex polygons. To work with concave polygons, a convex decomposition would need to be done first. This implies an increase in the run-time and the implementation of a new algorithm that decomposes the concave polygon into convex polygons.</p></li> <li><p><strong>Nesting by a power function</strong>: calculating the partial derivatives in the X and Y axes, you could get the escape direction you should take a polygon so that there is a collision between the two polygons. This function of energy and I tested and the three major problems that I have encountered are: first obtaining local minima , second nesting when the collision occurs over a piece and finally the execution time is very high.</p></li> <li><p>Using <strong>no-fit polygon</strong>: use the no-fit polygon to the nesting can be somewhat interesting. I have read several papers on the subject although there are very few online documentation on it. Not sure if it can really be a useful choice. I still have several doubts on the details of this approach.</p></li> </ul> <p>Any idea which of these algorithms to choose? Or if you know any other options that can be used? I'm a little confused :-) .</p> <p>Thank you very much.</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USrrufai
    1. USLuis del Valle
    plurals
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. POBest nesting algorithm
      1. This table or related slice is empty.
      1. VTApproveEditSuggestion
    2. VO
      singulars
      1. POBest nesting algorithm
      1. This table or related slice is empty.
      1. VTApproveEditSuggestion
    3. VO
      singulars
      1. POBest nesting algorithm
      1. USGeorge Profenza
      1. VTFavorite
    1. COIf you don't get an answer here, I'd try xposting this at MathOverflow.net
      singulars
      1. POBest nesting algorithm
      1. USim so confused
    2. COPretty cool challenge(+1). Personally I would probably go for a naive and brute force approach: using a vertlett/spring system and use it so solve collisions
      singulars
      1. POBest nesting algorithm
      1. USGeorge Profenza
    3. COI think this [question](http://stackoverflow.com/questions/2675123/nesting-maximum-amount-of-shapes-on-a-surface) might be related.
      singulars
      1. POBest nesting algorithm
      1. USrrufai
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload