levator over the automobile, complex issues are at play in concentrating population and built infrastructure in contemporary high-rise cities. How do you meet the challenges of system design for high quality compact urban environments?
The Smartgeometry Workshop is a unique creative cauldron attracting attendees from across the world of academia, professional practice and industry. The workshop is open to 100 applicants who come together for four intensive days of design and collaboration.
More Info and to Apply
The application deadline to attend the sg2014 Workshop has been extended to June 1st, 2014 at midnight PST. Reviews and early notifications will proceed for those who have already applied.
Image: Cities without Ground - Adam Frampton, Jonathan D Solomon and Clara Wong
WORKSHOP CLUSTERS
The sg2014 Workshop will be organised around Clusters. Clusters are hubs of expertise. They comprise of people, knowledge, tools, materials and machines. The Clusters provide a focus for workshop participants working together within a common framework.
Clusters provide a forum for the exchange of ideas, processes and techniques and act as a catalyst for design resolution. The sg2014 Workshop is made up of ten Clusters that respond in diverse ways to the challenge Urban Compaction.
sg2014 WORKSHOP CLUSTERS
The Bearable Lightness of Being
Block
Deep Space
Design Space Exploration
Flows, Bits, Relationships
Fulldome Projections
HK_smarTowers
Private Microclimates
Resilient Networks
Spaces in Experience
CONFERENCE
After four intense days of innovative work, the 2-day sgConference offers an opportunity for critical reflection on what has been accomplished in the Workshop and in the global design arena. It will be an opportunity to open debates, pose questions, challenge orthodoxies, and propose new ideas.
The sgConference features invited keynote speakers showcasing major projects and research from around the globe, mixed with panel sessions for open debate. The end of the first day will include reports and highlights from the Workshop, giving an opportunity to view work created during the previous four days of intensive collaboration, design and development, followed by an exhibition of the work.
Invited Speakers & Panelists:Carlo Ratti Sensable City Lab, MITCristiano Ceccato Zaha HadidTom Kvan & Justyna Karakiewicz Melbourne UniversityJun Sato Jun Sato Structural EngineersMario Carpo Yale UniversityEddie Can Zaha HadidLi Xinggang Atelier Li Xinggang, China Architecture Design & Research GroupMartin Reise FrontPhilip Yuan Tongji ShanghaiYusuke Obuchi Tokyo UniversityYusushi Ikada Ikada-Lab Keio University, Japan
Additional speakers to be announced soon. Registration to open soon.
www.Smartgeometry.org…
ating to new speakers.
For more information: https://medium.com/@carspeakerland/a-guide-to-the-simple-way-difference-in-car-speakers-2-way-3-way-4-way-25e0bf215b00
Adding new speakers for your automobile could improve the sound quality dramatically. Some sound technicians say it is the number-one update you may make to improve the overall quality of your vehicle.
"They do not care how it sounds. Speakers are often form of continue on the list. Updating to new speakers offers you a much fuller sound."
There is a whole lot to pick from in regards to car speakers. (Photo from Eldon Lindsay)
"New speakers will make a greater fidelity and clarity of sound," states Robert Nevitt, proprietor of Audio Electronics at Indianapolis. "The audio is more different without distortion. People will not get bored listening to it."
Cook says customers need to pick the type of sound they enjoy. The very first thing Cook does having a customer is sit in the car together to talk about their personal taste.
"Everybody's ear is different," he states. "That which I believe sounds great, you might believe is dreadful. It is a fantastic idea to get outside and listen to everything you enjoy and do not like about doing it."
When you've discovered a sound you want, you are going to discover the sky's actually the limitation in regards to purchasing car speakers. There are scores of manufactures and models, sizes and power levels to select from.
Columbus Car Audio & Accessories offers three types of automobile speakers to pick from: complete array speakers, component speakers along with coaxial speakers.
• Total range speakers arrive with a tweeter to make to your high-pitched sounds along with a woofer for those lows. This option offers a number of different sizes.
• Unit speakers, nonetheless, include separate tweeters and woofers.
• Coaxial speakers arrive with a tweeter plus motorist.
When you've selected a type of automobile speaker, you are going to want to determine how many you desire. Cook states some cars arrive with as little as just two speakers, whereas bigger, luxury vehicles might have too many 32. He adds a normal sedan generally has four. What are The Speaker Sizes in My Car | Speaker Size for My Car
"It simply depends if you would like to replace all of these," Cook says. "I would advise doing all of four. If you are budget-minded, I'd begin with the ones at the front. That is where you are at. And you are likely to be at the automobile 100 percent of their moment."
Subwoofers are designed to reproduce low bass frequencies also may be included with new speakers or could be added separately to existing car speakers.
"Many speakers can not play down low in these frequencies such as a subwoofer may," Cook says.
Related Article
Wondering about speakers? Below are a few techniques to establish a home entertainment experience whatever your budget.
A speaker update might charge as little as $100 up to a few million dollars depending on the scope of job and type of speaker.
Cook states that the price of a subwoofer can operate as low as $37. Columbus Car Audio & Accessories sells a subewoofer bundle that includes an amplifier and a enclosure for about $ 299.
To get a set of automobile speakers, Columbus Car Audio & Accessories begin prices at $39, with an average price tag of about $70 for setup. Adding an anti-vibrator into a set of speakers prices an additional $25.
Nevitt, meanwhile, fees as little as $99 to get a set of "some good speakers." The price of one hour of installion, that is typically how long it takes to put in a set of speakers, is 67.
However, most customers spend far more.
"Paying a total amount of 800 to $1000 isn't from this world of possibility," Nevitt states. "A price somewhere in the center could be $400 or $500."
Cook says several vehicle speaker technicians began with DIY projects and adds there is nothing wrong with trying to set up car speakers all on your own. But you are going to want the correct tools for your job along with just a little understand. Installing speakers requires carrying out your car door.
See Also: https://www.scoop.it/t/how-to-choose-best-car-speakers-6x9-inch-6-5-inch-6x8-inch-4-inch
Choosing a professional to set up speakers ensures that the job is done correctly.
"If you do it yourself, then you might wind up breaking something. That is some thing we do everyday. I am not planning to inform you we will not violate something. But we will look after it if we perform. We all do so with being honest and up front with people."
If you are getting speakers set up, experts say to expect to place an appointment to the setup. …
t. So here we go!
1. Honeybee is brown and not yellow [stupid!]...
As you probably remember Honeybee logo was initially yellow because of my ignorance about Honeybees. With the help of our Honeybee expert, Michalina, now the color is corrected. I promised her to update everyone about this. Below are photos of her working on the honeybee logo and the results of her study.
If you think I'm exaggerating by calling her a honeybee expert you better watch this video:
Thank you Michalina for the great work! :). I corrected the colors. No yellow anymore. The only yellow arrows represent sun rays and not the honeybee!
2. Yellow or brown, W[here]TH Honeybee is?
I know. It has been a long time after I posted the initial video and it is not fun at all to wait for a long time. Here is the good news. If you are following the Facebook page you probably now that the Daylighting components are almost ready.
Couple of friends from Grasshopper community and RADIANCE community has been helping me with testing/debugging the components. I still think/hope to release the daylighting components at some point in January before Ladybug gets one year old.
There have been multiple changes. I finally feel that the current version of Honeybee is simple enough for non-expert users to start running initial studies and flexible enough for advanced users to run advanced studies. I will post a video soon and walk you through different components.
I think I still need more time to modify the energy simulation components so they are not going to be part of the next release. Unfortunately, there are so many ways to set up and run a wrong energy simulation and I really don’t want to add one new GIGO app to the world of simulation. We already have enough of that. Moreover I’m still not quite happy with the workflow. Please bear with me for few more months and then we can all celebrate!
I recently tested the idea of connecting Grasshopper to OpenStudio by using OpenStudio API successfully. If nothing else, I really want to release the EnergyPlus components so I can concentrate on Grasshopper > OpenStudio development which I personally think is the best approach.
3. What about wind analysis?
I have been asked multiple times that if Ladybug will have a component for wind study. The short answer is YES! I have been working with EFRI-PULSE project during the last year to develop a free and open source web-based CFD simulation platform for outdoor analysis.
We had a very good progress so far and our rockstar Stefan recently presented the results of the work at the American Physical Society’s 66th annual DFD meeting and the results looks pretty convincing in comparison to measured data. Here is an image from the presentation. All the credits go to Stefan Gracik and EFRI-PULSE project.
The project will go live at some point next year and after that I will release the Butterfly which will let you prepare the model for the CFD simulation and send it to EFRI-PULSE project. I haven’t tried to run the simulations locally yet but I’m considering that as a further development. Here is how the component and the logo looks like right now.
4. Teaching resources
It has been almost 11 months from the first public release of Ladybug. I know that I didn't do a good job in providing enough tutorials/teaching materials and I know that I won’t be able to put something comprehensive together soon.
Fortunately, ladybug has been flying in multiple schools during the last year. Several design, engineering and consultant firms are using it and it has been thought in several workshops. As I checked with multiple of you, almost everyone told me that they will be happy to share their teaching materials; hence I started the teaching resources page. Please share your materials on the page. They can be in any format and any language. Thanks in advance!
I hope you enjoyed/are enjoying/will enjoy the longest night of the year. Happy Yalda!
Cheers,
-Mostapha
…
ting at multiple geometries in the same location. I simply sorted the list of values and used the Delete Consecutive component. This potentially rearranges the order of values but I don't think that matters in your case. I also threw in an Int component which actually seems to make a difference (try sidestepping it and you will see!).
2-I flattened the output of the mesh component before sending it to union. This ensures that the original mesh is booleaned once with all the components rather than individually with each of the 86 components.
Is this what the result should look like?
One suggestion for future postings: when referencing geometry in rhino, it often helps if you attach your rhino file as well so people don't have to guess where you are starting from.
If you have further questions, just ask ;-)
cbass…
This blog post is a rough approximation of the lecture I gave at the AAG10 conference in Vienna on September 21st 2010. Naturally it will be quite a different experience as the medium is quite…
Added by David Rutten at 3:27pm on September 24, 2010
ng is deciding how and where to store your data. If you're writing textual code using any one of a huge number of programming languages there are a lot of different options, each with its own benefits and drawbacks. Sometimes you just need to store a single data point. At other times you may need a list of exactly one hundred data points. At other times still circumstances may demand a list of a variable number of data points.
In programming jargon, lists and arrays are typically used to store an ordered collection of data points, where each item is directly accessible. Bags and hash sets are examples of unordered data storage. These storage mechanisms do not have a concept of which data comes first and which next, but they are much better at searching the data set for specific values. Stacks and queues are ordered data structures where only the youngest or oldest data points are accessible respectively. These are popular structures for code designed to create and execute schedules. Linked lists are chains of consecutive data points, where each point knows only about its direct neighbours. As a result, it's a lot of work to find the one-millionth point in a linked list, but it's incredibly efficient to insert or remove points from the middle of the chain. Dictionaries store data in the form of key-value pairs, allowing one to index complicated data points using simple lookup codes.
The above is a just a small sampling of popular data storage mechanisms, there are many, many others. From multidimensional arrays to SQL databases. From readonly collections to concurrent k-dTrees. It takes a fair amount of knowledge and practice to be able to navigate this bewildering sea of options and pick the best suited storage mechanism for any particular problem. We did not wish to confront our users with this plethora of programmatic principles, and instead decided to offer only a single data storage mechanism.*
Data storage in Grasshopper
In order to see what mechanism would be optimal for Grasshopper, it is necessary to first list the different possible ways in which components may wish to access and store data, and also how families of data points flow through a Grasshopper network, often acquiring more complexity over time.
A lot of components operate on individual values and also output individual values as results. This is the simplest category, let's call it 1:1 (pronounced as "one to one", indicating a mapping from single inputs to single outputs). Two examples of 1:1 components are Subtraction and Construct Point. Subtraction takes two arguments on the left (A and B), and outputs the difference (A-B) to the right. Even when the component is called upon to calculate the difference between two collections of 12 million values each, at any one time it only cares about three values; A, B and the difference between the two. Similarly, Construct Point takes three separate numbers as input arguments and combines them to form a single xyz point.
Another common category of components create lists of data from single input values. We'll refer to these components as 1:N. Range and Divide Curve are oft used examples in this category. Range takes a single numeric domain and a single integer, but it outputs a list of numbers that divide the domain into the specified number of steps. Similarly, Divide Curve requires a single curve and a division count, but it outputs several lists of data, where the length of each list is a function of the division count.
The opposite behaviour also occurs. Common N:1 components are Polyline and Loft, both of which consume a list of points and curves respectively, yet output only a single curve or surface.
Lastly (in the list category), N:N components are also available. A fair number of components operate on lists of data and also output lists of data. Sort and Reverse List are examples of N:N components you will almost certainly encounter when using Grasshopper. It is true that N:N components mostly fall into the data management category, in the sense that they are mostly employed to change the way data is stored, rather than to create entirely new data, but they are common and important nonetheless.
A rare few components are even more complex than 1:N, N:1, or N:N, in that they are not content to operate on or output single lists of data points. The Divide Surface and Square Grid components want to output not just lists of points, but several lists of points, each of which represents a single row or column in a grid. We can refer to these components as 1:N' or N':1 or N:N' or ... depending on how the inputs and outputs are defined.
The above listing of data mapping categories encapsulate all components that ship with Grasshopper, though they do not necessarily minister to all imaginable mappings. However in the spirit of getting on with the software it was decided that a data structure that could handle individual values, lists of values, and lists of lists of values would solve at least 99% of the then existing problems and was thus considered to be a 'good thing'.
Data storage as the outcome of a process
If the problems of 1:N' mappings only occurred in those few components to do with grids, it would probably not warrant support for lists-of-lists in the core data structure. However, 1:N' or N:N' mappings can be the result of the concatenation of two or more 1:N components. Consider the following case: A collection of three polysurfaces (a box, a capped cylinder, and a triangular prism) is imported from Rhino into Grasshopper. The shapes are all exploded into their separate faces, resulting in 6 faces for the box, 3 for the cylinder, and 5 for the prism. Across each face, a collection of isocurves is drawn, resembling a hatching. Ultimately, each isocurve is divided into equally spaced points.
This is not an unreasonably elaborate case, but it already shows how shockingly quickly layers of complexity are introduced into the data as it flows from the left to the right side of the network.
It's no good ending up with a single huge list containing all the points. The data structure we use must be detailed enough to allow us to select from it any logical subset. This means that the ultimate data structure must contain a record of all the mappings that were applied from start to finish. It must be possible to select all the points that are associated with the second polysurface, but not the first or third. It must also be possible to select all points that are associated with the first face of each polysurface, but not any subsequent faces. Or a selection which includes only the fourth point of each division and no others.
The only way such selection sets can be defined, is if the data structure contains a record of the "history" of each data point. I.e. for every point we must be able to figure out which original shape it came from (the cube, the cylinder or the prism), which of the exploded faces it is associated with, which isocurve on that face was involved and the index of the point within the curve division family.
A flexible mechanism for variable history records.
The storage constraints mentioned so far (to wit, the requirement of storing individual values, lists of values, and lists of lists of values), combined with the relational constraints (to wit, the ability to measure the relatedness of various lists within the entire collection) lead us to Data Trees. The data structure we chose is certainly not the only imaginable solution to this problem, and due to its terse notation can appear fairly obtuse to the untrained eye. However since data trees only employ non-negative integers to identify both lists and items within lists, the structure is very amenable to simple arithmetic operations, which makes the structure very pliable from an algorithmic point of view.
A data tree is an ordered collection of lists. Each list is associated with a path, which serves as the identifier of that list. This means that two lists in the same tree cannot have the same path. A path is a collection of one or more non-negative integers. Path notation employs curly brackets and semi-colons as separators. The simplest path contains only the number zero and is written as: {0}. More complicated paths containing more elements are written as: {2;4;6}. Just as a path identifies a list within the tree, an index identifies a data point within a list. An index is always a single, non-negative integer. Indices are written inside square brackets and appended to path notation, in order to fully identify a single piece of data within an entire data tree: {2,4,6}[10].
Since both path elements and indices are zero-based (we start counting at zero, not one), there is a slight disconnect between the ordinality and the cardinality of numbers within data trees. The first element equals index 0, the second element can be found at index 1, the third element maps to index 2, and so on and so forth. This means that the "Eleventh point of the seventh isocurve of the fifth face of the third polysurface" will be written as {2;4;6}[10]. The first path element corresponds with the oldest mapping that occurred within the file, and each subsequent element represents a more recent operation. In this sense the path elements can be likened to taxonomic identifiers. The species {Animalia;Mammalia;Hominidea;Homo} and {Animalia;Mammalia;Hominidea;Pan} are more closely related to each other than to {Animalia;Mammalia; Cervidea;Rangifer}** because they share more codes at the start of their classification. Similarly, the paths {2;4;4} and {2;4;6} are more closely related to each other than they are to {2;3;5}.
The messy reality of data trees.
Although you may agree with me that in theory the data tree approach is solid, you may still get frustrated at the rate at which data trees grow more complex. Often Grasshopper will choose to add additional elements to the paths in a tree where none in fact is needed, resulting in paths that all share a lot of zeroes in certain places. For example a data tree might contain the paths:
{0;0;0;0;0}
{0;0;0;0;1}
{0;0;0;0;2}
{0;0;0;0;3}
{0;0;1;0;0}
{0;0;1;0;1}
{0;0;1;0;2}
{0;0;1;0;3}
instead of the far more economical:
{0;0}
{0;1}
{0;2}
{0;3}
{1;0}
{1;1}
{1;2}
{1;3}
The reason all these zeroes are added is because we value consistency over economics. It doesn't matter whether a component actually outputs more than one list, if the component belongs to the 1:N, 1:N', or N:N' groups, it will always add an extra integer to all the paths, because some day in the future, when the inputs change, it may need that extra integer to keep its lists untangled. We feel it's bad behaviour for the topology of a data tree to be subject to the topical values in that tree. Any component which relies on a specific topology will no longer work when that topology changes, and that should happen as seldom as possible.
Conclusion
Although data trees can be difficult to work with and probably cause more confusion than any other part of Grasshopper, they seem to work well in the majority of cases and we haven't been able to come up with a better solution. That's not to say we never will, but data trees are here to stay for the foreseeable future.
* This is not something we hit on immediately. The very first versions of Grasshopper only allowed for the storage of a single data point per parameter, making operations like [Loft] or [Divide Curve] impossible. Later versions allowed for a single list per parameter, which was still insufficient for all but the most simple algorithms.
** I'm skipping a lot of taxonometric classifications here to keep it simple.…
Added by David Rutten at 2:22pm on January 20, 2015