{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T19:36:25Z","timestamp":1783107385162,"version":"3.54.6"},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2007,7,29]],"date-time":"2007-07-29T00:00:00Z","timestamp":1185667200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2007,7,29]]},"abstract":"<jats:p>We present a new general-purpose method for fast hierarchical importance sampling with blue-noise properties. Our approach is based on self-similar tiling of the plane or the surface of a sphere with rectifiable polyominoes. Sampling points are associated with polyominoes, one point per polyomino. Each polyomino is recursively subdivided until the desired local density of samples is reached. A numerical code generated during the subdivision process is used for thresholding to accept or reject the sample. The exact position of the sampling point within the polyomino is determined according to a structural index, which indicates the polyomino's local neighborhood. The variety of structural indices and associated sampling point positions are computed during the offline optimization process, and tabulated. Consequently, the sampling itself is extremely fast. The method allows both deterministic and pseudo-non-deterministic sampling. It can be successfully applied in a large variety of graphical applications, where fast sampling with good spectral and visual properties is required. The prime application is rendering.<\/jats:p>","DOI":"10.1145\/1276377.1276475","type":"journal-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T13:44:55Z","timestamp":1189777495000},"page":"78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":63,"title":["Sampling with polyominoes"],"prefix":"10.1145","volume":"26","author":[{"given":"Victor","family":"Ostromoukhov","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Montr\u00e9al"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,7,29]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Clarke A. L. 2006. The Poly Pages. http:\/\/www.recmath.com\/PolyPages.  Clarke A. L. 2006. The Poly Pages. http:\/\/www.recmath.com\/PolyPages."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141915"},{"key":"e_1_2_2_3_1","volume-title":"Polyominoes: Puzzles, Patterns, Problems, and Packings","author":"Golomb S. W.","year":"1996","unstructured":"Golomb , S. W. 1996 . Polyominoes: Puzzles, Patterns, Problems, and Packings . Princeton University Press . Golomb, S. W. 1996. Polyominoes: Puzzles, Patterns, Problems, and Packings. Princeton University Press."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1086\/427976"},{"key":"e_1_2_2_5_1","unstructured":"Gr\u00fcnbaum B. and Shephard G. 1986. Tilings and Patterns. W. H. Freeman.   Gr\u00fcnbaum B. and Shephard G. 1986. Tilings and Patterns . W. H. Freeman."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141916"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183287.1183296"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015750"},{"key":"e_1_2_2_9_1","unstructured":"Pharr M. and Humphreys G. 2004. Physically Based Rendering: Form Theory to Implementation. Morgan Kaufmann.   Pharr M. and Humphreys G. 2004. Physically Based Rendering: Form Theory to Implementation . Morgan Kaufmann."},{"key":"e_1_2_2_10_1","unstructured":"Rousselle F. Leblanc L. Clarberg P. Ostromoukhov V. and Poulin P. 2007. Hierarchical Threasholding for Efficient Sampling of the Product of All-Frequency Functions. Submitted work.  Rousselle F. Leblanc L. Clarberg P. Ostromoukhov V. and Poulin P. 2007. Hierarchical Threasholding for Efficient Sampling of the Product of All-Frequency Functions. Submitted work ."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1117\/12.152707"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276377.1276475","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1276377.1276475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:04Z","timestamp":1750258684000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276377.1276475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,29]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,7,29]]}},"alternative-id":["10.1145\/1276377.1276475"],"URL":"https:\/\/doi.org\/10.1145\/1276377.1276475","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,29]]},"assertion":[{"value":"2007-07-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}