{"action":"opened","issue":{"url":"https://api.github.com/repos/MakisH/CFDLab/issues/28","labels_url":"https://api.github.com/repos/MakisH/CFDLab/issues/28/labels{/name}","comments_url":"https://api.github.com/repos/MakisH/CFDLab/issues/28/comments","events_url":"https://api.github.com/repos/MakisH/CFDLab/issues/28/events","html_url":"https://github.com/MakisH/CFDLab/issues/28","id":83104783,"number":28,"title":"Performance: option to specify the locations of the obstacles","user":{"login":"MakisH","id":4943683,"avatar_url":"https://avatars.githubusercontent.com/u/4943683?v=3","gravatar_id":"","url":"https://api.github.com/users/MakisH","html_url":"https://github.com/MakisH","followers_url":"https://api.github.com/users/MakisH/followers","following_url":"https://api.github.com/users/MakisH/following{/other_user}","gists_url":"https://api.github.com/users/MakisH/gists{/gist_id}","starred_url":"https://api.github.com/users/MakisH/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/MakisH/subscriptions","organizations_url":"https://api.github.com/users/MakisH/orgs","repos_url":"https://api.github.com/users/MakisH/repos","events_url":"https://api.github.com/users/MakisH/events{/privacy}","received_events_url":"https://api.github.com/users/MakisH/received_events","type":"User","site_admin":false},"labels":[{"url":"https://api.github.com/repos/MakisH/CFDLab/labels/enhancement","name":"enhancement","color":"84b6eb"}],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2015-05-31T14:50:56Z","updated_at":"2015-05-31T14:50:56Z","closed_at":null,"body":"I have an idea:\r\nI think that this time we should implement the most naive implementation for the boundaries and obstacles, that is, to check every cell for its type and act accordingly if it is a boundary.\r\n\r\nThough, I just thought of a performance extension: we should provide the program with a hint of where boundaries really exist. That is, for example, \"there is a boundary somewhere in x=[x1,x2]\". This can be done either automatically (by examining the file once) or by the user.\r\n\r\nThen, we can implement something like the \"for(i=xmin, i<xmax, i++)\" implementation of Worksheet 2 for each obstacle, combined with an array of xmins and xmaxs and another for loop that iterates between each region.\r\n\r\nIt is not necessary and it is a bit complicated, so we should implement it last or even at a next worksheet."}}