Show Bid Request
Slicing Floorplan
Bid Request Id: 20147
|
|
|
|
Posted by: |
fred_legal (1 ratings)
(Software buyer rating 10 )
|
|
Non-action Ratio: |
Very Good - 0.00%
|
Buyer Security Verifications: |
Good
|
|
Approved on: |
Jun 28, 2002
1:11:12 AM EDT
|
|
Bidding Closes: |
Jul 4, 2002
1:20:47 AM EDT
|
|
Viewed (by coders): |
182 times
|
|
Deadline: |
7/5/2002
TIME EXPIRED
|
|
|
|
|
Description:
I need to implement a data structure for slicing floorplans. I need to use trees in order to implement techniques for slicing floorplans. It has to be implemented using an efficient algorithm that finds the smallest area implementation of the total floorplan assuming that each basic rectangle can be placed either horizontally or vertically. The output of this program should be the dimensions and a drawing of the best implementation of the total floorplan, and the choice (either Horizontal or Vertical) for each basic rectangle in the best implementation. If you are not sure about slicing floorplan here is a good explanation: Slicing floorplan is a composition of a rectangle with horizontal and vertical sides using horizontal and vertical cuts.
Deliverables:
A slicing floorplan can be represented by a binary tree, called a slicing tree, whose internal nodes represent the cuts, and whose external nodes represent the basic rectangles into which the floorplan is decomposed by the cuts. Therefore, the compaction problem is to find the smallest possible height and width for each rectangle of the slicing floorplan that is compatible with the minimum dimensions of the basic rectangles. This problem requires the assignment of values h(v) and w(v) to each node v of the slicing tree such that for the width(v) we have:
w: if v is an external node whose basic rectangle has minimum width w.
Max (w(w), w(z)): if v is an internal node associated with a horizontal cut with left child w and right child z.
w(w)+w(z): if v is an internal node associated with a vertical cut with left child w and right child z.
For the height we have the following:
h: if v is an external node whose basic rectangle has minimum height h.
h(v) +h(z): If v is an internal node associated with a horizontal cut with left child w and right child z.
Max(h(w), h(z)): v is a internal node associated with a vertical cut with left child w and right child z.
The floorplan has to support the following operations:
Create a floorplan consisting of a single basic rectangle
Decompose a basic rectangle by means of a horizontal cut.
Decompose a basic rectangle by means of a vertical cut.
Assign minimum height and width to a basic rectangle.
Compact the floorplan
Draw the compacted floorplan.
If you would like some more information and a visual picture of this assignment take a look at this site. It has a slicing floorplan demonstration. The site is the following:
http://www.cs.cf.ac.uk/user/C.L.Valenzuela/lisa/PostfixDemo.html
P.S. Please let me know as soon as you can if you will be able to help me with part of this project. We can negotiate a price if you are interested. Thank you very much for your time.
Platform:
Visual C++ on Windows XP
Must be 100% finished and received by buyer on:
Jul 5, 2002 EDT
Deadline legal notes: All times are expressed in the time zone of the site EDT (UT - 5). If the buyer omitted a time, then the deadline is 11:59:59 PM EDT on the indicated date.
Special Conditions / Other:
The pre-defined class tree in C++ cannot be used in this project.
Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements.
We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation.
If you notice a violation please help out the site and report it. Thanks for your help.
|
|
|
Bidding/Comments:
|
All monetary amounts on the site are in United States dollars.
Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. |
See all rejected bids (and all comments)
| Name |
Bid Amount
|
Date |
Coder Rating |
|
|
|
This bid was accepted by the buyer!
|
$50 (USD)
|
Jun 28, 2002
2:49:03 AM EDT
|
9.82
(Excellent)
|
|
|
| Dear sir,
I have strong experince with algorithms.
I would like to know if you are interested to do that before 30.
If you are interested in me, please accept it asap, and send a mail to me with that page that you are talking, because I can't connect to it.
If you think that 50$ is too much for that project, please propose yourself a price, I am open to negotiation.
Sincerly,
Marius. |
|
|
|
|
|
|