Capping Plane for Cut Sectional View(repost)(repost)
$30-5000 USD
Pagado a la entrega
Requirement:
Code needed to construct polygon/triangles that caps a cut section view.
Short Description:
Do cut section on a tessellated geometry for a given plane equation. Construct the intersection polygons that closes the hole.
Inputs: Geometry as set of triangles (e.g. stl file) and plane equation.
Output : Polygons that caps the geometry holes.
It is needed to develop platform independent C++ code like the following method.
void GetCapGeometry(std::vector<float> *inputGeometryVetrices*,
float *a*, float *b*, float *c*, float *d*,
std::vector<float> & *outputVericesforCap*);
Check for the attachement for STL Loader and usage.
## Deliverables
Sample Screen Shots given in the attachments.
* * *This broadcast message was sent to all bidders on Thursday Dec 15, 2011 11:39:22 AM:
Hi, Thanks for shown interest. Attached file is modified with STL Loader code, and required method interface for the delivery. Also a sample stl file. You can create OpenGL program to test the algorithm and share the executable with me to test the functionality. regards Dream3D
* * *This broadcast message was sent to all bidders on Monday Dec 26, 2011 6:40:25 AM:
Hi, I extend this project bid until 25th Jan 2012; This project is now re-posted to third time. It is because the previous developers were unable to complete and like to withdrew from the work. With that experience now my priority is to select a bid from who has a previous experience in this cut section algorithm. I will accept a non experience bid too if there is no bids with cut-section experience. Thanks for your bidding. It will help me to know your profiles and helps me to invite you in future tasks.
Nº del proyecto: #3739853