Jump to content

Search the Community

Showing results for tags 'branch'.



More search options

  • Search By Tags

    Type tags separated by commas.
  • Search By Author

Content Type


Forums

  • General
    • Lounge/General chat
    • Education
    • Jobs
    • Marketplace
  • Houdini
    • General Houdini Questions
    • Effects
    • Modeling
    • Animation & Rigging
    • Lighting & Rendering
    • Compositing
    • Games
    • Tools (HDA's etc.)
  • Coders Corner
    • HDK : Houdini Development Kit
    • Scripting
    • Shaders
  • Art and Challenges
    • Finished Work
    • Work in Progress
    • VFX Challenge
    • Effects Challenge Archive
  • Systems and Other Applications
    • Other 3d Packages
    • Operating Systems
    • Hardware
    • Pipeline
  • od|force
    • Feedback, Suggestions, Bugs

Found 2 results

  1. How find "Cracked Edge" ?

    Hi. Now I trying make geometry optimizer for fracturing for rbd sim, making "Solid" geometry from background models which often have bad topology. So I must find "Cracked Edge", two Primitives appear to be connected by single line, but the number of Points on Edge belonging to one of the Primitives is insufficient.This looks like Shared Edge, but it is actually Unshared Edge so specifically break PolyExtrude SOP. This Edge can be fixed by Union Boolean SOP, but my asset may import bad surface geometry which has many problem about Boolean SOP so I don't want use it as possible. How can we detect this? GeometryOptimize.zip
  2. I'm trying to create a high resolution procedural tree model (without using SpeedTree etc). I looked into L-systems but thats not much use for a more detailed model that is made of one mesh. This is a really interesting tutorial (and has been posted before) - http://www.andyboyd3d.com/siggraph_talk/img27.html But i'm wondering if theres a procedural way to create the branches (seen here - http://www.andyboyd3d.com/siggraph_talk/img32.html). I'm guessing this part was actually done manually but it would be great to have a procedural method! Cheers, Mike
×