{"action":"created","issue":{"url":"https://api.github.com/repos/evanbiederstedt/CMBintheLikeHoodz/issues/6","labels_url":"https://api.github.com/repos/evanbiederstedt/CMBintheLikeHoodz/issues/6/labels{/name}","comments_url":"https://api.github.com/repos/evanbiederstedt/CMBintheLikeHoodz/issues/6/comments","events_url":"https://api.github.com/repos/evanbiederstedt/CMBintheLikeHoodz/issues/6/events","html_url":"https://github.com/evanbiederstedt/CMBintheLikeHoodz/issues/6","id":116687766,"number":6,"title":"Timeit---number of direct LF evaluations of patches needed for full sky","user":{"login":"evanbiederstedt","id":6968193,"avatar_url":"https://avatars.githubusercontent.com/u/6968193?v=3","gravatar_id":"","url":"https://api.github.com/users/evanbiederstedt","html_url":"https://github.com/evanbiederstedt","followers_url":"https://api.github.com/users/evanbiederstedt/followers","following_url":"https://api.github.com/users/evanbiederstedt/following{/other_user}","gists_url":"https://api.github.com/users/evanbiederstedt/gists{/gist_id}","starred_url":"https://api.github.com/users/evanbiederstedt/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/evanbiederstedt/subscriptions","organizations_url":"https://api.github.com/users/evanbiederstedt/orgs","repos_url":"https://api.github.com/users/evanbiederstedt/repos","events_url":"https://api.github.com/users/evanbiederstedt/events{/privacy}","received_events_url":"https://api.github.com/users/evanbiederstedt/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":1,"created_at":"2015-11-13T02:34:56Z","updated_at":"2015-11-13T23:41:19Z","closed_at":null,"body":"The goal is to execute direct LF evaluation on patches covering the *entire* sky map. We can do this by first partitioning the whole full sky map into uniformly-shape patches. Patches are unique---the boundaries are clearly defined. \r\n\r\nMAIN GOAL: How many patches needed and what is the %timeit\r\n\r\nI know that matrices 3072 by 3072 pixels runs quick. 12288 by 12288 is doable, around 5 minutes.\r\n\r\nFor nside=512, that's approx. 3 million total pixels, 3145728. For 48 patches, that's 65536 pixels. For 192, that's 16384. TRY TO SEE if 65536 by 65536 is doable. If so, we need 48 total patch evaluations.\r\n\r\nFor nside=1024 (WMAP and Planck data product), that's around 12 million total pixels, 12582912. For 48 evaluations, that's matrices 262144 by 262144. We might need 192 patches, each at 65536. So, 192 patch evaluations.\r\n\r\nFor nside=2048 (Planck data product), that's around 50 million total pixels, 50331648. For 192, that's each a matrix 262144 by 262144. Maybe!\r\nOtherwise, try 768 patches, each patch at 65536 pixels.\r\n\r\nISSUES: Overlapping (1) Is this a problem? and (2) Can this be avoided? \r\n\r\nRE: (2)---the routine in question is IDL query_*, which has a keyword \"INCLUSIVE = if set, all the pixels overlapping (even partially) with the polygon are listed, otherwise only those whose center lies within the polygon are listed\" e.g. p. 106\r\nhttp://healpix.jpl.nasa.gov/pdf/idl.pdf\r\n\r\nQUESTION: Does slight overlapping matter? I would argue not. \r\n\r\nTASK: Show exactly how many pixels overlap...based on a few tests, it's only a few (dozen?) along the boundaries.\r\n"},"comment":{"url":"https://api.github.com/repos/evanbiederstedt/CMBintheLikeHoodz/issues/comments/156591454","html_url":"https://github.com/evanbiederstedt/CMBintheLikeHoodz/issues/6#issuecomment-156591454","issue_url":"https://api.github.com/repos/evanbiederstedt/CMBintheLikeHoodz/issues/6","id":156591454,"user":{"login":"evanbiederstedt","id":6968193,"avatar_url":"https://avatars.githubusercontent.com/u/6968193?v=3","gravatar_id":"","url":"https://api.github.com/users/evanbiederstedt","html_url":"https://github.com/evanbiederstedt","followers_url":"https://api.github.com/users/evanbiederstedt/followers","following_url":"https://api.github.com/users/evanbiederstedt/following{/other_user}","gists_url":"https://api.github.com/users/evanbiederstedt/gists{/gist_id}","starred_url":"https://api.github.com/users/evanbiederstedt/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/evanbiederstedt/subscriptions","organizations_url":"https://api.github.com/users/evanbiederstedt/orgs","repos_url":"https://api.github.com/users/evanbiederstedt/repos","events_url":"https://api.github.com/users/evanbiederstedt/events{/privacy}","received_events_url":"https://api.github.com/users/evanbiederstedt/received_events","type":"User","site_admin":false},"created_at":"2015-11-13T23:41:19Z","updated_at":"2015-11-13T23:41:19Z","body":"EDIT: We *could* define patches along \"boundaries\", but that's damn difficult for resolutions greater than nside=512,1024,2048. Just use the the pixel center, and learn to love overlapping. \r\n\r\nWhy even worry about overlapping? So what?\r\n\r\nWe are doing direct LF evaluations for each patch separately---there's no need to worry about \"overlapping issues\" for homogeneity tests. "}}