Kick start 2015

4月14日(火)    #01   13:30~ スタジオについて スケジュール スタジオ方針、これまで扱ってきた内容 ブログの運用・活用 (サマリーの投稿) ピンナップ、ドキュメンテーションフォーマット 今回主に扱うグラフ(ネットワーク)理論について 環境セットアップ Rhino/GH Pythonの構造

  • Comments Off on Kick start 2015

Time-Distance map of typical floors Shinjuku Mitsui building.

If we discretize continuous space by using random delaunay network, it becomes possible to find shortest path even on continuous space with arbitrary obstacles according to Dijkstra’s algorithm. In this article, we find shortest path from entrance of Mitsui building in Shinjuku to every place in the building. First animation shows the process of calculating distance (colors represent distance, red is far and blue is close), and drawing a time distance map from entrance of building. In this animation, you can easily realize how distant each place of building is. At a glance, you may think this building is homogenous, but can realize heterogenous space with many obstacles like walls,Read More »

  • Comments Off on Time-Distance map of typical floors Shinjuku Mitsui building.

CGAL wrap for rhino-python (through ctypes) Beta

Here just 2 functions (2d alpha shape and weighted voronoi diagram) wrapping from CGAL, combining rhino script functions. cgal_wrap.zip your script should be in the same folder How to use (2d weighted voronoi diagram, It would work on Gh-Python as well.): How to use (2d alpha shape, It would work on Gh-Python as well.)   for developer: here source code and project file(qmake)  cgal_wrapping_cpp requires: visual studio 2012 express, Qt 5.2 (64bit), CGAL-4.4, gmtl, mpfr, mpir, boost-1_55_0 It is still beta version and just for testing. I appreciate for your modification, adding more effective CGAL functions.  

  • Comments Off on CGAL wrap for rhino-python (through ctypes) Beta