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.


Members have full access to the forums. Advertisements are removed for registered users.

Results 1 to 3 of 3

Thread: Need a algorithm format of Butterfly Sub division technique

  1. #1
    Junior Member
    Join Date
    Jul 2014
    Thanked 0 Times in 0 Posts

    Default 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)
    Attached Images Attached Images
    Attached Files Attached Files

  2. #2
    Member Ada Lovelace's Avatar
    Join Date
    May 2014
    South England UK
    My Mood
    Thanked 61 Times in 55 Posts

    Default 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)

  3. #3
    Senior Member
    Join Date
    Jul 2013
    Thanked 120 Times in 104 Posts

    Default Re: Need a algorithm format of Butterfly Sub division technique

    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.

  4. The Following User Says Thank You to Cornix For This Useful Post:

    Ada Lovelace (July 17th, 2014)

Similar Threads

  1. ctt-sp algorithm(cost transitive tournament shortest path algorithm)
    By seeniya in forum Java Theory & Questions
    Replies: 3
    Last Post: April 22nd, 2014, 05:36 AM
  2. Replies: 6
    Last Post: June 3rd, 2013, 04:57 AM