probiner
With points, prims and vertices I honestly didn't also also find a straight answer in Python. Doing len(geo.points())is quite wasteful given that pointsneeds to build an object for each point, and I just want to know how many there are. That said I was able to circumvent this by using the detail intrinsics, geometry.intrinsicValue("pointcount")but alas, there is no "edgecount"

Is there maybe some procedure that is escaping me or is it RFE time?

Thanks
prb

vik_lc
Hey,

>>> obj = hou.node('/obj/geo1/box1')
>>> geo = obj.geometry()

# count by attribute class...
>>> len(geo.globEdges("*"))
12
>>> len(geo.globPoints("*"))
8

# edge object
>>> geo.point(2)
<hou.Point #2 of geometry in /obj/geo1/box1 read-only>
>>> p1 = geo.point(0)
>>> p2 = geo.point(1)
>>> edg = geo.findEdge(p1, p2)  # you can also look for edge groups
<hou.Edge #0 - 1 of geometry in /obj/geo1/box1 read-only>

>>> edg.edgeId()
'p0-1'
>>> edg.length()
1.0

There are a few more edge methods:
Edge [www.sidefx.com]

There is only one intristisic that relates to edges; which contains the edge groups .

An example of how to get the edge count in vex:

string edg_grp[] = detailintrinsic(0, "edgegroups");
printf("%s \n", edg_grp); // {group1, group2}

for(string grp : edg_grp)
{
    int n = nedgesgroup(0, grp);
    printf("%s: %i  \n", grp, n);
    // group1: 12 - the first group contains all cube edges 
    // group2: 4 -  the second only the bottom
}

Create a new edge group in vex:

// int  setedgegroup(int geohandle, string name, int pt0, int pt1, int value)
setedgegroup(0, "new_edg_grp", 0, 1, 1);

Find the new edge group in python:

>>> grp = geo.findEdgeGroup("new_edg_grp")
>>> len(grp.edges())
1

Andr

probiner
With points, prims and vertices I honestly didn't also also find a straight answer in Python. Doing len(geo.points())is quite wasteful given that pointsneeds to build an object for each point, and I just want to know how many there are. That said I was able to circumvent this by using the detail intrinsics, geometry.intrinsicValue("pointcount")but alas, there is no "edgecount"

Is there maybe some procedure that is escaping me or is it RFE time?

Thanks
prb

Since version 19.5.331, we have new methods to know the number of elements in a group:
EdgeGroup.edgeCount(), PointGroup.pointCount(), PrimGroup.primCount(), and VertexGroup.vertexCount()

Devs were super fast to implement these methods after I submitted the RFE (I had your very same concerns about performance of using len(geo.points()) )
I guess they could be as much fast if you RFE for the more general methods.

probiner
With points, prims and vertices I honestly didn't also also find a straight answer in Python. Doing len(geo.points())is quite wasteful given that pointsneeds to build an object for each point, and I just want to know how many there are.
prb

Andr
Since version 19.5.331, we have new methods to know the number of elements in a group:
EdgeGroup.edgeCount(), PointGroup.pointCount(), PrimGroup.primCount(), and VertexGroup.vertexCount()

Devs were super fast to implement these methods after I submitted the RFE (I had your very same concerns about performance of using len(geo.points()) )
I guess they could be as much fast if you RFE for the more general methods.

int edgecount = 0;
int pts [ ] = neighbours ( 0, @ptnum );
foreach ( int pt; pts )
    if ( @ptnum < pt )
        edgecount += 1;
        
i@edgecount = edgecount;

animatrix_
If I had to do this in Python, I would use this Python function:
https://www.sidefx.com/docs/houdini/hom/hou/hscriptExpression.html [www.sidefx.com]

Because it's still a limitation in Python HOM that needs to be addressed.

animatrix_
Getting the edge count will be tricky. Your best bet is probably to use VEX for this. I would just use neighbours or half edges and sum the edge count.

Point Wrangle:

int edgecount = 0;
int pts [ ] = neighbours ( 0, @ptnum );
foreach ( int pt; pts )
    if ( @ptnum < pt )
        edgecount += 1;
        
i@edgecount = edgecount;

Then Attribute Promote. For 4M polygons, it takes 0.5s to cook.

probiner

animatrix_
If I had to do this in Python, I would use this Python function:
https://www.sidefx.com/docs/houdini/hom/hou/hscriptExpression.html [www.sidefx.com]

Because it's still a limitation in Python HOM that needs to be addressed.

I assume you're mentioning this for getting the other counts and not edgecount? Because there's no nedges() (equivalent to npoints()). For those the geometry.intrinsicValue("pointcount")and alike are quite instantaneous.

animatrix_

probiner

animatrix_
If I had to do this in Python, I would use this Python function:
https://www.sidefx.com/docs/houdini/hom/hou/hscriptExpression.html [www.sidefx.com]

Because it's still a limitation in Python HOM that needs to be addressed.

I assume you're mentioning this for getting the other counts and not edgecount? Because there's no nedges() (equivalent to npoints()). For those the geometry.intrinsicValue("pointcount")and alike are quite instantaneous.

Oh yes because that was what I filed an RFE for over 7 years ago. But I agree edge count would also be immensely useful.

probiner

animatrix_

probiner

animatrix_
If I had to do this in Python, I would use this Python function:
https://www.sidefx.com/docs/houdini/hom/hou/hscriptExpression.html [www.sidefx.com]

Because it's still a limitation in Python HOM that needs to be addressed.

I assume you're mentioning this for getting the other counts and not edgecount? Because there's no nedges() (equivalent to npoints()). For those the geometry.intrinsicValue("pointcount")and alike are quite instantaneous.

Oh yes because that was what I filed an RFE for over 7 years ago. But I agree edge count would also be immensely useful.

Right, I've added those nedges() functions to the request.

Cheers

elovikov
Also currently it's not that difficult to create your own geometry functions based on verbs and graph invokation.

Here's the example of such function based on animatrix approach (I think it's the fastest one).

The function in the session module and can be used in any script on geometry.

subnet = hou.node('/obj/geo1/subnet1')
path = hou.text.expandString("$HOME/subnet")
subnet.parent().saveItemsToFile([subnet], path)
f = open(path, 'rb')
f.read()

animatrix_

probiner
With points, prims and vertices I honestly didn't also also find a straight answer in Python. Doing len(geo.points())is quite wasteful given that pointsneeds to build an object for each point, and I just want to know how many there are.
prb

Andr
Since version 19.5.331, we have new methods to know the number of elements in a group:
EdgeGroup.edgeCount(), PointGroup.pointCount(), PrimGroup.primCount(), and VertexGroup.vertexCount()

Devs were super fast to implement these methods after I submitted the RFE (I had your very same concerns about performance of using len(geo.points()) )
I guess they could be as much fast if you RFE for the more general methods.

I submitted it over 7 years ago. Feel free to revive my RFE: #26541 The current ticket is closed.

If I had to do this in Python, I would use this Python function:
https://www.sidefx.com/docs/houdini/hom/hou/hscriptExpression.html [www.sidefx.com]

Because it's still a limitation in Python HOM that needs to be addressed.

elovikov
Currently verbs (as python sop verbs) are available only for certain atomic nodes. There is no obvious way to "verbify" hdas.
Basically sop compilation is the way of creating custom verbs.

Sorry, I've deleted the part where I created this string. I just put it back in the example so it's a bit more clear. Just look at the attached hip.

I'm only using one verb: Invoke Graph https://www.sidefx.com/docs/houdini/nodes/sop/invokegraph.html [www.sidefx.com]
It's a tool that can invoke a graph stored in geometry. Basically you can create any sop graph (even procedurally so it's also a metaprogramming feature which is really cool) and invoke it on any other geometry.

Unfortunately creating such graphs is rather cumbersome. Currently, if you want to dump any subnetwork to geometry you use Attribute From Parameters SOP which isn't very intuitive suggested by its name.
I've also mentioned how to do it in detail here: https://www.sidefx.com/forum/topic/84322/#post-364485 [www.sidefx.com]

probiner
With points, prims and vertices I honestly didn't also also find a straight answer in Python. Doing len(geo.points())is quite wasteful given that pointsneeds to build an object for each point, and I just want to know how many there are. That said I was able to circumvent this by using the detail intrinsics, geometry.intrinsicValue("pointcount")but alas, there is no "edgecount"

Andr

probiner
With points, prims and vertices I honestly didn't also also find a straight answer in Python. Doing len(geo.points())is quite wasteful given that pointsneeds to build an object for each point, and I just want to know how many there are. That said I was able to circumvent this by using the detail intrinsics, geometry.intrinsicValue("pointcount")but alas, there is no "edgecount"

len(geo.iterPoints()) is much faster.

I've always assumed iterPoints() was an iterator and so you couldn't ask for its len(). It's actually a generator.