{"title":"线性时间泊松盘模式","authors":"T. R. Jones, David R Karger","doi":"10.1080/2151237X.2011.617173","DOIUrl":null,"url":null,"abstract":"Abstract We present an algorithm for generating Poisson-disk patterns taking O(N) time to generate N points. The method is based on a grid of regions that can contain no more than one point in the final pattern, and which uses an explicit model of point-arrival times under a uniform Poisson process.","PeriodicalId":354935,"journal":{"name":"Journal of Graphics, GPU, and Game Tools","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Linear-Time Poisson-Disk Patterns\",\"authors\":\"T. R. Jones, David R Karger\",\"doi\":\"10.1080/2151237X.2011.617173\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We present an algorithm for generating Poisson-disk patterns taking O(N) time to generate N points. The method is based on a grid of regions that can contain no more than one point in the final pattern, and which uses an explicit model of point-arrival times under a uniform Poisson process.\",\"PeriodicalId\":354935,\"journal\":{\"name\":\"Journal of Graphics, GPU, and Game Tools\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graphics, GPU, and Game Tools\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/2151237X.2011.617173\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graphics, GPU, and Game Tools","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/2151237X.2011.617173","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Abstract We present an algorithm for generating Poisson-disk patterns taking O(N) time to generate N points. The method is based on a grid of regions that can contain no more than one point in the final pattern, and which uses an explicit model of point-arrival times under a uniform Poisson process.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
