19 replies to this topic

[rdg]

My current project is called "Procedural Plagiarism".

0003_0001: Rounded Corners



Houdini OTL that creates fillets – aka rounded corners – on all points of a curve.
Works nice on Spheres, too.

This Procedural Plagiarism was inspired by 3D Studio Max’s Curve Fillet and spoongraphics.

Download: rdg_roundedCorner.tar.gz

Edited by rdg, 15 November 2011 - 12:09 PM.

[ben]

Very usefull.
Thanks for sharing!

[Matt_K]

This will come in handy!
Thanks for sharing.

Matt.

[smaugthewyrm]

omg. wonderful! thank you!

[rdg]

Thanks guys.

However - the presented solution got some shortcomings in respect to support for groups.

This following snippet is a pythonSOP that outputs a mix of polySplines and NURBS to maintain the point ordering.
In H11 hou.Face.positionAt could probably be used to sample nurbsCurves at the fillets to output a homogeneous polySpline. In H10 the SOP outputs a mix of polySplines and Nurbs. H10 requires a resampleSOP and fuse.

Inputs:
group (string)
optFillet (float)
optFit (float)

# This code is called when instances of this SOP cook.
geo = hou.pwd().geometry()

# Add code to modify the contents of geo.

grpParmValue = hou.evalParm('group').strip()

inputPoints = geo.points()
inputPnums = [ p.number() for p in inputPoints ]
nPoints = len( inputPoints )

grpParmValue = hou.evalParm('group').strip()

if len( grpParmValue ) == 0:
	grpPoints = inputPoints
	grpPoints = inputPnums
else:
	grpPoints = geo.globPoints( grpParmValue )
	grpPnums = [ p.number() for p in grpPoints ]

poly = geo.createPolygon()
poly.setIsClosed( False )

for n in range( 0, nPoints ):
	if n == 0 or n == nPoints -1 or not n in grpPnums:
		np = geo.createPoint()
		np.setPosition( inputPoints[n].position() )
		poly.addVertex( np )
	else:
		
		fillet = geo.createNURBSCurve( 4, False )
		
		tmp = (( inputPoints[n].position() - inputPoints[ n-1].position() ) * 0.5 )
		fillet.vertices()[0].point().setPosition( inputPoints[n].position() - tmp.normalized() *  min(tmp.length(), hou.evalParm( 'optFillet' ) ) )
		
		np = geo.createPoint( )
		np.setPosition( fillet.vertices()[0].point().position() )
		poly.addVertex( np )
		fillet.vertices()[1].point().setPosition( inputPoints[n].position() - tmp.normalized() *  min(tmp.length(), hou.evalParm( 'optFillet' ) ) * hou.evalParm( 'optFit' ) )

	   
		tmp = (( inputPoints[ n + 1 ].position() - inputPoints[n].position()) * 0.5 )
		fillet.vertices()[2].point().setPosition( inputPoints[n].position() + tmp.normalized() * min(tmp.length(), hou.evalParm( 'optFillet' ) ) * hou.evalParm( 'optFit' ) )

		fillet.vertices()[3].point().setPosition( inputPoints[n].position() + tmp.normalized() * min(tmp.length(), hou.evalParm( 'optFillet' ) ) )
		
		poly = geo.createPolygon()
		poly.setIsClosed( False )
		np = geo.createPoint()
		np.setPosition( fillet.vertices()[3].point().position() )
		poly.addVertex( np )

geo.deletePoints( inputPoints )

Edited by rdg, 25 October 2010 - 09:53 PM.

[rdg]

02: 0003_0002 - Paint with Triangles



This Houdini OTL assists in creating Delaunay triangulated imagery.

This Procedural Plagiarism was inspired by Jonathan Puckey’s “Delauney Raster“

Download: rdg_paintWithTriangles.tar.gz

Edited by rdg, 31 October 2010 - 12:25 PM.

[pagefan]

rdg, on 31 October 2010 - 12:22 PM, said:

02: 0003_0002 - Paint with Triangles



This Houdini OTL assists in creating Delaunay triangulated imagery.

This Procedural Plagiarism was inspired by Jonathan Puckey’s “Delauney Raster“

Download: rdg_paintWithTriangles.tar.gz

Hi Georg,

nice effect! Great stuff to make dazzle paintings. Also reminds me of Lyonel Feininger's paintings, can make my own now.

To nitpick a bit, i made two improvements to your setup. One was to scale the image. The resolution tends to be rather big. Scaling an image by a factor of 0.1 resizes it a bit to the Nachtwacht/Guernica proportions. Secondly, the facet_unique_points seems unnecessary. The colour from the points is promoted the same if you have unique points as with fused points.

Cheers,
Hans

[rdg]

03: 0003_0003: Processing


Video on Vimeo

A meditation in Houdini’s foreachSOP.

Points are grouped by their distance to each other.
Each group’s points then are sorted by their distance to the group’s ‘main point’.
A addSOP connects the main point to it’s children.

Why oh why didn’t I use a pythonSOP ? And what about search-able data structures – like trees?

This Procedural Plagiarism was inspired by the image on the cover of: “Processing: A Programming Handbook for Visual Designers and Artists” by Casey Reas and Ben Fry[1].

 rdg_processing_0001.tar.gz   43.69K   245 downloads

[1] http://processing.org/learning/books/

Edited by rdg, 07 November 2010 - 01:37 PM.

[ndeewolfwood]

yeah !!!!
this post is epic...
thanks for sharing.

[Matt_K]

As usual, nice work, and thanks for sharing!

Matt.

[Allegro]

Hey Georg! Cool stuff, I'm just coming across this stuff now. Love it.

[rdg]

04: 0003_0004: Recursive Subdivide



Take a rectangular Polygon.
Choose a random point on one of the sides.
Choose a random point on the opposite side.
Split the polygon using a plane through these two points.
Repeat.

This Procedural Plagiarism was inspired by Justin Windle’s “Recursive Subdivision“.

Thanks to Graham for fixing my initial PythonSOP implementation!

Attached Files

•  rdg_subdivide_0001.tar.gz   38.49K   179 downloads