{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"Taurus","owner":"Ideas-Laboratory","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"JavaScript","color":"#f1e05a"},"pullRequestCount":0,"issueCount":0,"starsCount":10,"forksCount":7,"license":"GNU Lesser General Public License v2.1","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-01T09:34:12.705Z"}},{"type":"Public","name":"om3","owner":"Ideas-Laboratory","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":0,"issueCount":1,"starsCount":0,"forksCount":1,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-07-30T12:17:52.594Z"}},{"type":"Public","name":"Aspect-Ratio-Selection","owner":"Ideas-Laboratory","isFork":false,"description":"Datasets of paper “Image-Based Aspect Ratio Selection” and \"Is There a Robust Technique for Selecting Aspect Ratios in Line Charts?\" from IEEE TVCG","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-07-05T14:20:59.875Z"}},{"type":"Public","name":"RScag","owner":"Ideas-Laboratory","isFork":false,"description":"Code and dataset of the paper \"Improving the Robustness of Scagnostics\" from IEEE InfoVis 2019.","allTopics":[],"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-07-05T14:10:04.624Z"}},{"type":"Public","name":"cast","owner":"Ideas-Laboratory","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"JavaScript","color":"#f1e05a"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-02-08T13:47:33.882Z"}},{"type":"Public","name":"t-fdp","owner":"Ideas-Laboratory","isFork":false,"description":"Source code, data, analysis code of experiment for the paper \"Force-directed graph layouts revisited: a new force based on the t-Distribution\". ","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":9,"forksCount":2,"license":"GNU Lesser General Public License v2.1","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-12-15T10:35:09.099Z"}},{"type":"Public","name":"SizePairs","owner":"Ideas-Laboratory","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"GNU General Public License v3.0","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-11-17T05:07:33.355Z"}},{"type":"Public","name":"O3NJ","owner":"Ideas-Laboratory","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"JavaScript","color":"#f1e05a"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-10-15T02:43:28.850Z"}},{"type":"Public","name":"Joint_tsne","owner":"Ideas-Laboratory","isFork":false,"description":"The implementation for paper Joint t-SNE for Comparable Projections of Multiple High-Dimensional Datasets.","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":9,"forksCount":3,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-01-11T08:37:45.648Z"}},{"type":"Public","name":"EdWordle_refactor","owner":"Ideas-Laboratory","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"JavaScript","color":"#f1e05a"},"pullRequestCount":0,"issueCount":2,"starsCount":4,"forksCount":0,"license":null,"participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-08-21T14:21:39.383Z"}},{"type":"Public","name":"canis-compiler","owner":"Ideas-Laboratory","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"JavaScript","color":"#f1e05a"},"pullRequestCount":9,"issueCount":0,"starsCount":3,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-08-12T22:44:23.887Z"}},{"type":"Public","name":"ProgressivePyramidBasedSampling","owner":"Ideas-Laboratory","isFork":false,"description":"","allTopics":["sampling","progressive","visualization","scatterplots"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-07-09T09:50:44.972Z"}},{"type":"Public","name":"canis","owner":"Ideas-Laboratory","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"JavaScript","color":"#f1e05a"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-08-14T07:10:37.764Z"}},{"type":"Public","name":"SineStream","owner":"Ideas-Laboratory","isFork":false,"description":"The source code of paper \"SineStream: Improving the Readability of Streamgraphs by Minimizing Sine Illusion Effects\"","allTopics":[],"primaryLanguage":{"name":"JavaScript","color":"#f1e05a"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-08-05T12:09:19.777Z"}},{"type":"Public","name":"DRImplicitVecXform","owner":"Ideas-Laboratory","isFork":false,"description":"The source code of paper \"Implicit Multidimensional Projection of Local Subspaces\"","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-08-01T09:26:49.283Z"}},{"type":"Public","name":"shape-coseg-dataset","owner":"Ideas-Laboratory","isFork":false,"description":"The Shape COSEG Dataset","allTopics":["dataset","segmentation","datasets","mesh-data","mesh-segmentation","segmentation-datasets"],"primaryLanguage":{"name":"HTML","color":"#e34c26"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-06-07T11:44:29.598Z"}},{"type":"Public","name":"vectorized_stress_majorization","owner":"Ideas-Laboratory","isFork":false,"description":"Source code of our paper at IEEE InfoVis 2017. More info can be found at <a href=\"https://vislab.wang/post/revisiting-stress-majorization-as-a-unified-framework-for-interactive-constrained-graph-visualization\" rel=\"nofollow\">https://vislab.wang/post/revisiting-stress-majorization-as-a-unified-framework-for-interactive-constrained-graph-visualization</a>","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":7,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-04-17T15:28:34.852Z"}},{"type":"Public","name":"RecursiveSubdivision-basedSampling","owner":"Ideas-Laboratory","isFork":false,"description":"The implement of the algorithm proposed in our IEEE VIS 2019 technical paper, more infomation can be found in <a href=\"http://www.yunhaiwang.net/infoVis2019/scatterplot/index.html\" rel=\"nofollow\">http://www.yunhaiwang.net/infoVis2019/scatterplot/index.html</a>","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":10,"forksCount":3,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-12-02T05:15:37.389Z"}},{"type":"Public archive","name":"constrained-graph-lib","owner":"Ideas-Laboratory","isFork":false,"description":"(THIS PROJECT HAD BEEN ARCHIVED) Yet another constrained graph library","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-05-09T05:25:33.048Z"}}],"repositoryCount":19,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Ideas-Laboratory repositories"}