Ben Doherty's Page

Danny Boyes replied to Ben Doherty's discussion Version control

"Rhino has a similar, if not the same, feature with IncrementalSave on the File Menu"

Apr 16

Ben Doherty replied to Ben Doherty's discussion Version control

"The "File>Document Properties>Add Revision" model is interesting! In 3dsMax there is an option to increment on save, which just adds a number to your file name that is one bigger, this means that every time you [ctrl]+[s] it saves a…"

Apr 16

Danny Boyes replied to Ben Doherty's discussion Version control

"I use the international date convention as a suffix for file names to keep track of ever changing projects. that way when you order them on name they are sequential. e.g. Version_20130101.gh Version_20130228.gh Version_20130416.gh There is also an…"

Apr 16

Ben Doherty posted a discussion

Version control

Hi, I often make things that work, and then gradually morph them into things that don't work. When I'm coding I can use git or some other version control tool to track my changes, but GH files are binary, and GHX files seem to change so dramatically when I make changes that they don't seem to be worth tracking.Has anyone had any luck using any sort of version control with grasshopper? As a side thought, if it turns out that version control is silly, is there a good workflow to capture what…See More

Apr 16

3 Comments

Ben Doherty replied to Ben Doherty's discussion Curve subdivision by chord height

"Thanks Tobias, I hadn't found that. I'll have to play with it some more to see if I can get more control over it, but at the moment I can't see a way to get a precise chord height. That said, if you just want more subdivisions…"

Apr 16

Ben Doherty replied to Ben Doherty's discussion Curve subdivision by chord height

"I asked on stack overflow here:http://stackoverflow.com/questions/15941728/divide-curve-by-chord-height And got a pretty hardcore answer that's going me some time to unpack, but if is of any help to you..."

Apr 13

Tobias Schwinn replied to Ben Doherty's discussion Curve subdivision by chord height

"Hi Ben, not sure if this helps, and probably you've found this out already, but if you wanted to just control the maximum chord height there is a built-in method ToPolyline, which is part of the Curve class. The tolerance attribute will control…"

Apr 11

David Rutten replied to Ben Doherty's discussion Curve subdivision by chord height

"I'm trying to get this done using Curve Deviation SDK functions but it's taking for frikkin' ever. If I do get something that actually works and completes in under a minute for an average curve I'll let you know... -- David…"

Apr 11

Ben Doherty replied to Ben Doherty's discussion Curve subdivision by chord height

"For the moment just a single/list of chord heights would do. I suppose people might like to find a way to make it fit their curve exactly, but I'm not overly fussed about that."

Apr 11

David Rutten replied to Ben Doherty's discussion Curve subdivision by chord height

"Is it just equal heights or is it division for a specific height? The latter would be easier as you can take it one segment at a time. -- David Rutten david@mcneel.com Poprad, Slovakia"

Apr 11

Ben Doherty posted a discussion

Curve subdivision by chord height

I'd like to subdivide a curve into segments with equal chord heights. I know I can divide into equal chord lengths with the Divide Distance tool, but I can't find a height option.I've written some really dirty code that does it here. Don't judge me, it's inelegant and inefficient, but it does the job.…See More

Apr 10

6 Comments

Ben Doherty replied to Ben Doherty's discussion Example of Quad tree used for closest point search speed up?

"Hi, sorry for the very delayed reply. it wasn't a c# question, it was actually about using the quad tree component to produce an input to a bit of python, but the question was about the output of the quad tree component. I was trying to roll my…"

Mar 14

Ben Doherty posted a discussion

traversing sparse trees

Hi, I'm trying to find the indices of some successful intersections in a data tree so that I can use them to index into another array to do some brep splitting.There is probably a much better grasshopperish way to do this, but I'm interested in the way to traverse datatrees in general.The way I've been doing it so far is producing a list with a single entity in it rather than a list with nulls in it. The way my brain wants to think about this involves a sparse array that has a bunch of…See More

Dec 17, 2012

0 Comments

diego perez-espitia replied to Ben Doherty's discussion returning IronPython.Runtime.List, not the actual list

"hey ben, i'm running into exactly the same problem. did you find a way around this? best d "

Sep 11, 2012

David Rutten replied to Ben Doherty's discussion Example of Quad tree used for closest point search speed up?

"Hi Ben, is this a C#/VB question? If so, can you move it into the C#/VB/Python forum? -- David Rutten david@mcneel.com Poprad, Slovakia"

Jul 31, 2012

Ben Doherty posted a discussion

Example of Quad tree used for closest point search speed up?

All I can find is pattern making, does anyone have an example of how to use the data structure of a quad tree to find the closest point in a big set?At the moment I'm doing an O(n^2) search and it is too slow.See More

Jul 30, 2012

2 Comments