Last active
October 16, 2017 11:25
-
-
Save zeffii/90fa1a83ce821d6ae03a71ae91e7cdd5 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# ##### BEGIN GPL LICENSE BLOCK ##### | |
# | |
# This program is free software; you can redistribute it and/or | |
# modify it under the terms of the GNU General Public License | |
# as published by the Free Software Foundation; either version 2 | |
# of the License, or (at your option) any later version. | |
# | |
# This program is distributed in the hope that it will be useful, | |
# but WITHOUT ANY WARRANTY; without even the implied warranty of | |
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
# GNU General Public License for more details. | |
# | |
# You should have received a copy of the GNU General Public License | |
# along with this program; if not, write to the Free Software Foundation, | |
# Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. | |
# | |
# ##### END GPL LICENSE BLOCK ##### | |
import bpy | |
import mathutils | |
# from bpy.props import FloatProperty, BoolProperty | |
from mathutils import Vector | |
from mathutils.geometry import interpolate_bezier | |
from sverchok.node_tree import SverchCustomTreeNode | |
from sverchok.data_structure import updateNode | |
def get_points_bezier(spline, clean=True): | |
knots = spline.bezier_points | |
if len(knots) < 2: | |
return | |
# verts per segment | |
r = spline.resolution_u + 1 | |
# segments in spline | |
segments = len(knots) | |
if not spline.use_cyclic_u: | |
segments -= 1 | |
master_point_list = [] | |
for i in range(segments): | |
inext = (i + 1) % len(knots) | |
knot1 = knots[i].co | |
handle1 = knots[i].handle_right | |
handle2 = knots[inext].handle_left | |
knot2 = knots[inext].co | |
bezier = knot1, handle1, handle2, knot2, r | |
points = interpolate_bezier(*bezier) | |
master_point_list.extend(points) | |
# some clean up to remove consecutive doubles, this could be smarter... | |
if clean: | |
old = master_point_list | |
good = [v for i, v in enumerate(old[:-1]) if not old[i] == old[i + 1]] | |
good.append(old[-1]) | |
return good | |
# makes edge keys, ensure cyclic | |
Edges = [[i, i + 1] for i in range(n_verts - 1)] | |
if spline.use_cyclic_u: | |
Edges.append([i, 0]) | |
return master_point_list, Edges | |
class SvCurveInputNode(bpy.types.Node, SverchCustomTreeNode): | |
''' Curve data in ''' | |
bl_idname = 'SvCurveInputNode' | |
bl_label = 'Curve Input' | |
bl_icon = 'CURVE' | |
def sv_init(self, context): | |
... | |
def draw_buttons(self, context, layout): | |
... | |
def process(self): | |
objects_in = self.objects.get() | |
for obj in objects: | |
# end early! | |
if not obj.type == 'CURVE': | |
return | |
for obj in objects: | |
m = obj.matrix_world | |
mtrx.append(m[:]) | |
# spline = bpy.data.curves[0].splines[0] | |
# points = get_points_bezier(spline) | |
for spline in obj.data.splines: | |
verts, edges = get_points(spline, clean=True) | |
edgs_out.append(edges) | |
vers_out.append(verts) | |
mtrx_out.append(obj.matrix_world[:]) | |
continue | |
def register(): | |
bpy.utils.register_class(SvCurveInputNode) | |
def unregister(): | |
bpy.utils.unregister_class(SvCurveInputNode) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment