Jump to content

pusat

Members
  • Content count

    105
  • Joined

  • Last visited

  • Days Won

    7

pusat last won the day on August 28

pusat had the most liked content!

Community Reputation

98 Excellent

3 Followers

About pusat

  • Rank
    Initiate

Personal Information

  • Name
    Yunus

Recent Profile Visitors

1,351 profile views
  1. Simple VEX/Houdini array question

    You can also use len VEX function but both return integers.
  2. select one edge from group ?

    Edge groups are not as easy to work in Houdini as point/prim groups. You can do this using a Python SOP though: edge = geo.findEdgeGroup("edgegroup").edges()[0] newgroup = geo.createEdgeGroup("one") newgroup.add(edge)
  3. Smallest-circle problem to bound points?

    I made this operator when I first started using Houdini. It's from Dave Eberly's library: https://www.dropbox.com/s/ojzptmfpafqjw5n/MinimumCircle_SOP_Animatrix.otl?dl=1 Could be made faster by using least squares methods instead.
  4. Pyro Clustering Tutorial

    You can also do this without a For Loop block using a Volume Wrangle SOP.
  5. Houdini 17 Wishlist

    There are many other kitchen and sink nodes that need to be broken up: Facet SOP, Primitive SOP, Fuse SOP, etc.
  6. For Each Element in Group

    If you loop over the enum attribute, the -1 will only be 1 iteration and you can skip it by using a switch node so it's not costly to do so.
  7. For Each Element in Group

    Enumerate SOP can do this.
  8. It's the simplest method but not the fastest. If you want to perform this operation the fastest, you need to pre-generate your points using Point Generate SOP (nprims()) and then move each point to the center of each primitive using the second input as the reference. That way you avoid the geometry creation and deletion operations, both of which are very expensive. Creating points using Point Generate SOP is extremely fast, since it creates all points at the origin.
  9. Volume Deform SOP

    Straight VEX based volume deformation with no geometry conversion in between.
  10. Two minute papers

    I find that channel pretty useless. Just non-technical commentary on new papers.
  11. Indeed, this tool only creates connections between immediate neighbours up to N depth, so you don't need to create unnecessary connections. After that you can decide how to break up your glue network using noise, rules, etc. In your case you can easily identify the connections that belong to different material by querying the attributes as this node stores original name attributes, and which piece they originate from, etc.
  12. You can achieve it using something like this: Later on I made a more generic version called Adjacency Skeleton. Need to update the video sometime
  13. I think you need some kind of optical flow algorithm so you can certainly use PCA: https://ps.is.tue.mpg.de/research_projects/pca-flow https://github.com/jswulff/pcaflow https://asp-eurasipjournals.springeropen.com/articles/10.1155/2010/680623
  14. Performs PCA (Principal Component Analysis) on a point cloud.
×