Here is the Butterfly sub division technique which refines the mesh of a STL file.I have to prepare a java code based on this technique, please anyone can give the step by step procedure or algorithm for this.(files attached)
Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Need a algorithm format of Butterfly Sub division technique
Here is the Butterfly sub division technique which refines the mesh of a STL file.I have to prepare a java code based on this technique, please anyone can give the step by step procedure or algorithm for this.(files attached)
Related threads:
Re: Need a algorithm format of Butterfly Sub division technique
What have you tried so far? Show any code with any problems and people will help you.
Wishes Ada xx
If to Err is human - then programmers are most human of us all.
"The Analytical Engine offers a new, a vast, and a powerful language . . .
for the purposes of mankind."
— Augusta Ada Byron, Lady Lovelace (1851)
Re: Need a algorithm format of Butterfly Sub division technique
Step-by-step-guide:
1) Read about the algorithm in papers, books or other online research.
2) Try to write down the algorithm on paper, think about the code you are going to need, data structures, classes, etc.
3) Implement your own ideas of the algorithm
4) Test your algorithm
5) If the testing found any bugs, go back to step 2 (or maybe even 1)
If you have any specific questions, ask here.
Ada Lovelace (July 17th, 2014)
Reply With Quote