Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

sorry for my bad English... I've a system consists of many cuboids, many are adjacent to the others. My problem is... I want to find the largest cube in this system (which may consists of many of some or all part of the cuboids)

Is there a decent algorithm for finding this ?

share|improve this question
    
For example... each cuboid defined by x,y,z(it origin)... has length of(Lx,Ly,Lz) which explains it's size. –  pantoffski Feb 27 '11 at 23:27
    
This could be better suited for cstheory.stackexchange.com As is I don't understand what you are trying to do? –  Eric Naslund Feb 27 '11 at 23:32
    
oh! thanks for a fast reply ! I'll do another post at cstheory as you suggested. Btw, my problem is ... if you have a cuboid starting at(0,0,0) with size(10,10,10) and another cuboid at(10,0,0) with size(10,10,10) and another cuboid at(0,10,0) with size(10,10,10) and another cuboid at(0,0,10) with size(10,10,10) and another cuboid at(10,10,10) with size(9,9,9) so, the largest cube in the system will be a cube starting at (0,0,0) with size(19,19,19) something like that –  pantoffski Feb 27 '11 at 23:49
    
I made an mistake!! Post it on: stackoverflow.com, the other one is for research level CS. I am not sure how to move questions between stacks. –  Eric Naslund Feb 28 '11 at 0:01
    
Never mind, It's a part of my research topic anyway :) I'm just want a faster than sweep plane method I have which maintain largest size of square each tip can hold –  pantoffski Feb 28 '11 at 0:04

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.