A Simple Algorithm for Maximal Poisson-Disk Sampling in High Dimensions
We provide a simple algorithm and data structures for d‐dimensional unbiased maximal Poisson‐disk sampling. We use an order of magnitude less memory and time than the alternatives. Our results become more favorable as the dimension increases. This allows us to produce bigger samplings. Domains may b...
Saved in:
Published in | Computer graphics forum Vol. 31; no. 2pt4; pp. 785 - 794 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
Oxford, UK
Blackwell Publishing Ltd
01.05.2012
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | We provide a simple algorithm and data structures for d‐dimensional unbiased maximal Poisson‐disk sampling. We use an order of magnitude less memory and time than the alternatives. Our results become more favorable as the dimension increases. This allows us to produce bigger samplings. Domains may be non‐convex with holes. The generated point cloud is maximal up to round‐off error. The serial algorithm is provably bias‐free. For an output sampling of size n in fixed dimension d, we use a linear memory budget and empirical θ(n) runtime. No known methods scale well with dimension, due to the “curse of dimensionality.” The serial algorithm is practical in dimensions up to 5, and has been demonstrated in 6d. We have efficient GPU implementations in 2d and 3d. The algorithm proceeds through a finite sequence of uniform grids. The grids guide the dart throwing and track the remaining disk‐free area. The top‐level grid provides an efficient way to test if a candidate dart is disk‐free. Our uniform grids are like quadtrees, except we delay splits and refine all leaves at once. Since the quadtree is flat it can be represented using very little memory: we just need the indices of the active leaves and a global level. Also it is very simple to sample from leaves with uniform probability. |
---|---|
AbstractList | We provide a simple algorithm and data structures for d-dimensional unbiased maximal Poisson-disk sampling. We use an order of magnitude less memory and time than the alternatives. Our results become more favorable as the dimension increases. This allows us to produce bigger samplings. Domains may be non-convex with holes. The generated point cloud is maximal up to round-off error. The serial algorithm is provably bias-free. For an output sampling of size n in fixed dimension d, we use a linear memory budget and empirical [theta](n) runtime. No known methods scale well with dimension, due to the "curse of dimensionality." The serial algorithm is practical in dimensions up to 5, and has been demonstrated in 6d. We have efficient GPU implementations in 2d and 3d. The algorithm proceeds through a finite sequence of uniform grids. The grids guide the dart throwing and track the remaining disk-free area. The top-level grid provides an efficient way to test if a candidate dart is disk-free. Our uniform grids are like quadtrees, except we delay splits and refine all leaves at once. Since the quadtree is flat it can be represented using very little memory: we just need the indices of the active leaves and a global level. Also it is very simple to sample from leaves with uniform probability. [PUBLICATION ABSTRACT] We provide a simple algorithm and data structures for d‐dimensional unbiased maximal Poisson‐disk sampling. We use an order of magnitude less memory and time than the alternatives. Our results become more favorable as the dimension increases. This allows us to produce bigger samplings. Domains may be non‐convex with holes. The generated point cloud is maximal up to round‐off error. The serial algorithm is provably bias‐free. For an output sampling of size n in fixed dimension d, we use a linear memory budget and empirical θ(n) runtime. No known methods scale well with dimension, due to the “curse of dimensionality.” The serial algorithm is practical in dimensions up to 5, and has been demonstrated in 6d. We have efficient GPU implementations in 2d and 3d. The algorithm proceeds through a finite sequence of uniform grids. The grids guide the dart throwing and track the remaining disk‐free area. The top‐level grid provides an efficient way to test if a candidate dart is disk‐free. Our uniform grids are like quadtrees, except we delay splits and refine all leaves at once. Since the quadtree is flat it can be represented using very little memory: we just need the indices of the active leaves and a global level. Also it is very simple to sample from leaves with uniform probability. We provide a simple algorithm and data structures for d-dimensional unbiased maximal Poisson-disk sampling. We use an order of magnitude less memory and time than the alternatives. Our results become more favorable as the dimension increases. This allows us to produce bigger samplings. Domains may be non-convex with holes. The generated point cloud is maximal up to round-off error. The serial algorithm is provably bias-free. For an output sampling of size n in fixed dimension d, we use a linear memory budget and empirical [thetas](n) runtime. No known methods scale well with dimension, due to the "curse of dimensionality." The serial algorithm is practical in dimensions up to 5, and has been demonstrated in 6d. We have efficient GPU implementations in 2d and 3d. The algorithm proceeds through a finite sequence of uniform grids. The grids guide the dart throwing and track the remaining disk-free area. The top-level grid provides an efficient way to test if a candidate dart is disk-free. Our uniform grids are like quadtrees, except we delay splits and refine all leaves at once. Since the quadtree is flat it can be represented using very little memory: we just need the indices of the active leaves and a global level. Also it is very simple to sample from leaves with uniform probability. |
Author | Mitchell, Scott A. Owens, John D. Patney, Anjul Ebeida, Mohamed S. Davidson, Andrew A. |
Author_xml | – sequence: 1 givenname: Mohamed S. surname: Ebeida fullname: Ebeida, Mohamed S. organization: Sandia National Laboratories – sequence: 2 givenname: Scott A. surname: Mitchell fullname: Mitchell, Scott A. organization: Sandia National Laboratories – sequence: 3 givenname: Anjul surname: Patney fullname: Patney, Anjul organization: University of California, Davis – sequence: 4 givenname: Andrew A. surname: Davidson fullname: Davidson, Andrew A. organization: University of California, Davis – sequence: 5 givenname: John D. surname: Owens fullname: Owens, John D. organization: University of California, Davis |
BookMark | eNqNkE1PwyAYgInRxDn9DyRevHTyUVp68LBsbjPOr2zGI8EKk62FCVvs_r3UGQ-e5MKb8DwEnhNwaJ1VAECMejiuy2UPp1me8IwVPYIw6SGK4tgcgM7vwSHoIBznHDF2DE5CWCKE0jxjHTDuw5mp15WC_WrhvNm811A7D-9kY2pZwUdnQnA2GZqwgjMZSWMX0Fg4MYt3ODS1ssE4G07BkZZVUGc_exc8j67ng0kyfRjfDPrTpGSEFwnWZckJL9O3Mk9TrKnMUM5liQiRjDAsZcG5ohozXlCdp4VWRL8pzAkliKtX2gUX-3vX3n1sVdiI2oRSVZW0ym2DwIhyilAR9S44_4Mu3dbb-LpIkZiJ0Eh3Ad9TpXcheKXF2sef-12ERFtYLEUbUrQhRVtYfBcWTVSv9uqnqdTu354YjEftFP1k75uwUc2vL_1KZDnNmXi5HwuOb5_YfJCJOf0CIOmQOA |
CitedBy_id | crossref_primary_10_1016_j_cma_2015_01_017 crossref_primary_10_1117_1_JEI_23_6_063015 crossref_primary_10_1111_cgf_13366 crossref_primary_10_1111_cgf_14059 crossref_primary_10_1111_cgf_13565 crossref_primary_10_1111_cgf_13368 crossref_primary_10_1145_3476576_3476717 crossref_primary_10_1007_s40571_024_00781_4 crossref_primary_10_1145_3450626_3459880 crossref_primary_10_1109_TRO_2016_2632160 crossref_primary_10_1111_cgf_13848 crossref_primary_10_1007_s11390_015_1535_0 crossref_primary_10_1088_1742_5468_ac561a crossref_primary_10_1016_j_cma_2023_116725 crossref_primary_10_1142_S0218202514400065 crossref_primary_10_1016_j_cag_2014_09_015 crossref_primary_10_1145_2932186 crossref_primary_10_1155_2016_3973467 crossref_primary_10_1109_TVCG_2020_3016645 crossref_primary_10_1111_j_1467_8659_2012_03182_x crossref_primary_10_1145_2522528 crossref_primary_10_1111_cgf_12538 crossref_primary_10_1145_3337680 crossref_primary_10_1111_cgf_13256 crossref_primary_10_3389_fninf_2020_00031 crossref_primary_10_1145_3072959_3119910 crossref_primary_10_1145_3414685_3417881 crossref_primary_10_1007_s00466_016_1307_x crossref_primary_10_1007_s00371_015_1120_0 crossref_primary_10_1145_3233310 crossref_primary_10_1016_j_cam_2013_12_023 crossref_primary_10_1145_2980179_2982435 crossref_primary_10_1016_j_cma_2013_04_009 crossref_primary_10_1007_s00371_018_1541_7 crossref_primary_10_1016_j_proeng_2014_10_397 crossref_primary_10_1145_2185520_2185572 crossref_primary_10_1088_1742_6596_1592_1_012067 crossref_primary_10_1002_nme_4744 crossref_primary_10_1007_s00371_014_0948_z crossref_primary_10_1109_ACCESS_2020_2988582 crossref_primary_10_1109_TVCG_2014_2322357 crossref_primary_10_1145_3119910 crossref_primary_10_1145_3194657 crossref_primary_10_1145_2461912_2462023 crossref_primary_10_1007_s11042_017_5563_3 crossref_primary_10_1119_1_5049954 crossref_primary_10_1016_j_chemphys_2024_112205 crossref_primary_10_1016_j_commatsci_2019_109269 crossref_primary_10_1007_s41095_015_0003_7 crossref_primary_10_1109_TNNLS_2020_2982936 crossref_primary_10_1007_s10955_023_03097_4 crossref_primary_10_1088_2399_6528_ab8064 crossref_primary_10_1145_2516971_2516973 crossref_primary_10_1016_j_cagd_2016_02_004 crossref_primary_10_1007_s00371_012_0709_9 crossref_primary_10_1145_2751541 crossref_primary_10_1155_2018_9104720 crossref_primary_10_1109_TVCG_2016_2641963 crossref_primary_10_1111_cgf_12981 crossref_primary_10_1016_j_cad_2013_08_016 crossref_primary_10_1016_j_cad_2013_08_015 crossref_primary_10_1109_TVCG_2013_63 crossref_primary_10_1080_23324309_2018_1481433 crossref_primary_10_1016_j_proeng_2016_11_033 crossref_primary_10_1016_j_cam_2022_114094 crossref_primary_10_1111_cgf_12071 |
Cites_doi | 10.1145/37402.37410 10.1016/j.cad.2011.08.012 10.1145/1095878.1095888 10.1145/1276377.1276475 10.1016/S0013-7944(98)00069-1 10.1063/1.460109 10.2514/6.2010-2924 10.1145/1882261.1866188 10.1145/1141911.1141915 10.1080/2151237X.2006.10129217 10.1145/1278780.1278807 10.1137/100786356 10.1145/1015706.1015750 10.1145/7529.8927 10.1061/(ASCE)0733-9399(1995)121:9(1016) 10.1145/325165.325182 10.1145/2010324.1964944 10.1007/978-3-642-24734-7_15 10.1145/1640443.1640451 10.1007/s00454-003-2870-4 10.1109/RT.2007.4342600 10.1145/1360612.1360619 10.1145/882262.882265 |
ContentType | Journal Article |
Copyright | 2012 The Author(s) Computer Graphics Forum © 2012 The Eurographics Association and Blackwell Publishing Ltd. |
Copyright_xml | – notice: 2012 The Author(s) Computer Graphics Forum © 2012 The Eurographics Association and Blackwell Publishing Ltd. |
DBID | BSCLL AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D F28 FR3 |
DOI | 10.1111/j.1467-8659.2012.03059.x |
DatabaseName | Istex CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
DatabaseTitleList | Computer and Information Systems Abstracts CrossRef Technology Research Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Computer Science |
EISSN | 1467-8659 |
EndPage | 794 |
ExternalDocumentID | 2686400731 10_1111_j_1467_8659_2012_03059_x CGF3059 ark_67375_WNG_81KQ5TC6_T |
Genre | article Feature |
GroupedDBID | .3N .4S .DC .GA .Y3 05W 0R~ 10A 15B 1OB 1OC 29F 31~ 33P 3SF 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5HH 5LA 5VS 66C 6J9 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 8VB 930 A03 AAESR AAEVG AAHHS AANLZ AAONW AASGY AAXRX AAZKR ABCQN ABCUV ABDBF ABDPE ABEML ABPVW ACAHQ ACBWZ ACCFJ ACCZN ACFBH ACGFS ACPOU ACSCC ACXBN ACXQS ADBBV ADEOM ADIZJ ADKYN ADMGS ADOZA ADXAS ADZMN ADZOD AEEZP AEGXH AEIGN AEIMD AEMOZ AENEX AEQDE AEUQT AEUYR AFBPY AFEBI AFFNX AFFPM AFGKR AFPWT AFZJQ AHBTC AHEFC AITYG AIURR AIWBW AJBDE AJXKR AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN AMBMR AMYDB ARCSS ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BSCLL BY8 CAG COF CS3 CWDTD D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EAD EAP EBA EBO EBR EBS EBU EDO EJD EMK EST ESX F00 F01 F04 F5P FEDTE FZ0 G-S G.N GODZA H.T H.X HF~ HGLYW HVGLF HZI HZ~ I-F IHE IX1 J0M K1G K48 LATKE LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ O66 O9- OIG P2W P2X P4D PALCI PQQKQ Q.N Q11 QB0 QWB R.K RDJ RIWAO RJQFR ROL RX1 SAMSI SUPJJ TH9 TN5 TUS UB1 V8K W8V W99 WBKPD WIH WIK WOHZO WQJ WRC WXSBR WYISQ WZISG XG1 ZL0 ZZTAW ~IA ~IF ~WT G8K AAMNL AAYXX ACRPL ACYXJ CITATION 7SC 8FD JQ2 L7M L~C L~D F28 FR3 |
ID | FETCH-LOGICAL-c5289-1fcc828c4dc7441f3a6078ac022a5251aa988e3f15893f749fe2fde1823208eb3 |
IEDL.DBID | DR2 |
ISSN | 0167-7055 |
IngestDate | Wed Dec 04 15:42:48 EST 2024 Thu Dec 05 04:28:34 EST 2024 Fri Dec 06 02:03:57 EST 2024 Sat Aug 24 00:57:01 EDT 2024 Wed Oct 30 09:54:14 EDT 2024 |
IsDoiOpenAccess | false |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 2pt4 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c5289-1fcc828c4dc7441f3a6078ac022a5251aa988e3f15893f749fe2fde1823208eb3 |
Notes | istex:B4406C72CB5BBD2CC13A81787BFCD83F958892C2 ark:/67375/WNG-81KQ5TC6-T ArticleID:CGF3059 ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
OpenAccessLink | https://escholarship.org/content/qt1z40j2rv/qt1z40j2rv.pdf?t=qhoro4 |
PQID | 1020302310 |
PQPubID | 30877 |
PageCount | 10 |
ParticipantIDs | proquest_miscellaneous_1038300989 proquest_journals_1020302310 crossref_primary_10_1111_j_1467_8659_2012_03059_x wiley_primary_10_1111_j_1467_8659_2012_03059_x_CGF3059 istex_primary_ark_67375_WNG_81KQ5TC6_T |
PublicationCentury | 2000 |
PublicationDate | May 2012 |
PublicationDateYYYYMMDD | 2012-05-01 |
PublicationDate_xml | – month: 05 year: 2012 text: May 2012 |
PublicationDecade | 2010 |
PublicationPlace | Oxford, UK |
PublicationPlace_xml | – name: Oxford, UK – name: Oxford |
PublicationTitle | Computer graphics forum |
PublicationYear | 2012 |
Publisher | Blackwell Publishing Ltd |
Publisher_xml | – sequence: 0 name: Blackwell Publishing Ltd – name: Blackwell Publishing Ltd |
References | Babuška I., Nobile F., Tempone R.: A stochastic collocation method for elliptic partial differential equations with random input data. SIAM Review 52, 2 (2010), 317-355. 2 Bolander J. E., Saito S.: Fracture analyses using spring networks with random geometry. Engineering Fracture Mechanics 61, 5-6 (1998), 569-591. 2 Ostromoukhov V.: Sampling with polyominoes. ACM Transactions on Graphics 26, 3 (July 2007), 78:1-78:6. 3 Ebeida M. S., Mitchell S. A., Davidson A. A., Patney A., Knupp P. M., Owens J. D.: Efficient and good Delaunay meshes from random points. Computer-Aided Design 43, 11 (2011), 1506-1515. Solid and Physical Modeling. 2 Pharr M., Humphreys G.: Physically Based Rendering: From Theory to Implementation. Morgan Kaufmann Publishers Inc., San Francisco , CA , USA , 2004. 2 Lagae A., Dutré P.: A procedural object distribution function. ACM Transactions on Graphics 24, 4 (Oct. 2005), 1442-1461. 3 Gamito M. N., Maddock S. C.: Accurate multidimensional Poisson-disk sampling. ACM Transactions on Graphics 29, 1 (Dec. 2009), 8:1-8:19. 3, 4, 5, 7 Dunbar D., Humphreys G.: A spatial data structure for fast Poisson-disk sample generation. ACM Transactions on Graphics 25, 3 (July 2006), 503-508. 3, 5 Ebeida M. S., Patney A., Mitchell S. A., Davidson A., Knupp P. M., Owens J. D.: Efficient maximal Poisson-disk sampling. ACM Transactions on Graphics 30, 4 (July 2011), 49:1-49:12. 4, 5, 7, 8 Wei L.-Y.: Parallel Poisson disk sampling. ACM Transactions on Graphics 27, 3 (Aug. 2008), 20:1-20:9. 3, 4, 5, 8 Attali D., Boissonnat J.-D.: A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces. Discrete & Computational Geometry 31, 3 (Feb. 2004), 369-384. 2 Cook R. L.: Stochastic sampling in computer graphics. ACM Transactions on Graphics 5, 1 (Jan. 1986), 51-72. 3, 5 Cohen M. F., Shade J., Hiller S., Deussen O.: Wang tiles for image and texture generation. ACM Transactions on Graphics 22, 3 (July 2003), 287-294. 3 Dickman R., Wang J.-S., Jensen I.: Random sequential adsorption: Series and virial expansions. Journal of Chemical Physics 94 (1991), 8252-8257. 2 Jirásek M., Bazant Z. P.: Particle model for quasibrittle fracture and its application to sea ice. Journal of Engineering Mechanics 121 (1995), 1016-1025. 2 Ostromoukhov V., Donohue C., Jodoin P.-M.: Fast hierarchical importance sampling with blue noise properties. ACM Transactions on Graphics 23, 3 (Aug. 2004), 488-495. 3 Bowers J., Wang R., Wei L.-Y., Maletz D.: Parallel Poisson disk sampling with spectrum analysis on surfaces. ACM Transactions on Graphics 29 (Dec. 2010), 166:1-166:10. 3, 4 Jones T. R.: Efficient generation of Poisson-disk sampling patterns. Journal of Graphics Tools 11, 2 (2006), 27-36. 3, 5 Dec. 2009; 29 July 2006; 25 Feb. 2004; 31 2011 July 2011; 30 2010 1991; 94 2007 1996 Sept. 2007 2004 1998; 61 2006; 2 Jan. 1986; 5 Dec. 2010; 29 July 2003; 22 July 1987 July 1985 Oct. 2005; 24 Aug. 2008; 27 Aug. 2004; 23 2011; 43 July 2007; 26 1995; 121 2010; 52 e_1_2_8_27_2 e_1_2_8_28_2 e_1_2_8_23_2 e_1_2_8_25_2 e_1_2_8_26_2 e_1_2_8_9_2 Pharr M. (e_1_2_8_24_2) 2004 e_1_2_8_2_2 e_1_2_8_4_2 e_1_2_8_3_2 e_1_2_8_6_2 e_1_2_8_5_2 e_1_2_8_8_2 e_1_2_8_7_2 e_1_2_8_20_2 e_1_2_8_21_2 e_1_2_8_22_2 e_1_2_8_16_2 e_1_2_8_17_2 e_1_2_8_18_2 e_1_2_8_19_2 e_1_2_8_12_2 e_1_2_8_13_2 e_1_2_8_14_2 e_1_2_8_15_2 e_1_2_8_10_2 e_1_2_8_11_2 |
References_xml | – year: 2011 – volume: 94 start-page: 8252 year: 1991 end-page: 8257 article-title: Random sequential adsorption: Series and virial expansions publication-title: Journal of Chemical Physics – start-page: 65 year: July 1987 end-page: 72 – volume: 5 start-page: 51 issue: 1 year: Jan. 1986 end-page: 72 article-title: Stochastic sampling in computer graphics publication-title: ACM Transactions on Graphics – volume: 29 start-page: 8:1 issue: 1 year: Dec. 2009 end-page: 8:19 article-title: Accurate multidimensional Poisson‐disk sampling publication-title: ACM Transactions on Graphics – start-page: 22 year: 2007 – volume: 30 start-page: 49:1 issue: 4 year: July 2011 end-page: 49:12 article-title: Efficient maximal Poisson‐disk sampling publication-title: ACM Transactions on Graphics – volume: 52 start-page: 317 issue: 2 year: 2010 end-page: 355 article-title: A stochastic collocation method for elliptic partial differential equations with random input data publication-title: SIAM Review – volume: 24 start-page: 1442 issue: 4 year: Oct. 2005 end-page: 1461 article-title: A procedural object distribution function publication-title: ACM Transactions on Graphics – volume: 121 start-page: 1016 year: 1995 end-page: 1025 article-title: Particle model for quasibrittle fracture and its application to sea ice publication-title: Journal of Engineering Mechanics – volume: 29 start-page: 166:1 year: Dec. 2010 end-page: 166:10 article-title: Parallel Poisson disk sampling with spectrum analysis on surfaces publication-title: ACM Transactions on Graphics – volume: 23 start-page: 488 issue: 3 year: Aug. 2004 end-page: 495 article-title: Fast hierarchical importance sampling with blue noise properties publication-title: ACM Transactions on Graphics – start-page: 129 year: Sept. 2007 end-page: 132 – year: 2010 – volume: 31 start-page: 369 issue: 3 year: Feb. 2004 end-page: 384 article-title: A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces publication-title: Discrete & Computational Geometry – volume: 26 start-page: 78:1 issue: 3 year: July 2007 end-page: 78:6 article-title: Sampling with polyominoes publication-title: ACM Transactions on Graphics – volume: 22 start-page: 287 issue: 3 year: July 2003 end-page: 294 article-title: Wang tiles for image and texture generation publication-title: ACM Transactions on Graphics – volume: 43 start-page: 1506 issue: 11 year: 2011 end-page: 1515 article-title: Efficient and good Delaunay meshes from random points publication-title: Computer-Aided Design – volume: 27 start-page: 20:1 issue: 3 year: Aug. 2008 end-page: 20:9 article-title: Parallel Poisson disk sampling publication-title: ACM Transactions on Graphics – start-page: 258 year: 2011 end-page: 275 – year: 2004 – volume: 2 start-page: 27 year: 2006 end-page: 36 article-title: Efficient generation of Poisson‐disk sampling patterns publication-title: Journal of Graphics Tools 11 – start-page: 47 year: 1996 end-page: 61 – start-page: 69 year: July 1985 end-page: 78 – volume: 61 start-page: 569 issue: 5–6 year: 1998 end-page: 591 article-title: Fracture analyses using spring networks with random geometry publication-title: Engineering Fracture Mechanics – volume: 25 start-page: 503 issue: 3 year: July 2006 end-page: 508 article-title: A spatial data structure for fast Poisson‐disk sample generation publication-title: ACM Transactions on Graphics – ident: e_1_2_8_21_2 – ident: e_1_2_8_20_2 doi: 10.1145/37402.37410 – ident: e_1_2_8_13_2 doi: 10.1016/j.cad.2011.08.012 – ident: e_1_2_8_19_2 doi: 10.1145/1095878.1095888 – ident: e_1_2_8_23_2 doi: 10.1145/1276377.1276475 – ident: e_1_2_8_5_2 doi: 10.1016/S0013-7944(98)00069-1 – ident: e_1_2_8_11_2 doi: 10.1063/1.460109 – ident: e_1_2_8_28_2 doi: 10.2514/6.2010-2924 – ident: e_1_2_8_6_2 doi: 10.1145/1882261.1866188 – ident: e_1_2_8_9_2 doi: 10.1145/1141911.1141915 – ident: e_1_2_8_18_2 doi: 10.1080/2151237X.2006.10129217 – ident: e_1_2_8_4_2 doi: 10.1145/1278780.1278807 – ident: e_1_2_8_3_2 doi: 10.1137/100786356 – ident: e_1_2_8_22_2 doi: 10.1145/1015706.1015750 – ident: e_1_2_8_7_2 doi: 10.1145/7529.8927 – ident: e_1_2_8_16_2 doi: 10.1061/(ASCE)0733-9399(1995)121:9(1016) – ident: e_1_2_8_10_2 doi: 10.1145/325165.325182 – ident: e_1_2_8_17_2 – ident: e_1_2_8_25_2 – volume-title: Physically Based Rendering: From Theory to Implementation year: 2004 ident: e_1_2_8_24_2 contributor: fullname: Pharr M. – ident: e_1_2_8_14_2 doi: 10.1145/2010324.1964944 – ident: e_1_2_8_12_2 doi: 10.1007/978-3-642-24734-7_15 – ident: e_1_2_8_15_2 doi: 10.1145/1640443.1640451 – ident: e_1_2_8_2_2 doi: 10.1007/s00454-003-2870-4 – ident: e_1_2_8_26_2 doi: 10.1109/RT.2007.4342600 – ident: e_1_2_8_27_2 doi: 10.1145/1360612.1360619 – ident: e_1_2_8_8_2 doi: 10.1145/882262.882265 |
SSID | ssj0004765 |
Score | 2.400343 |
Snippet | We provide a simple algorithm and data structures for d‐dimensional unbiased maximal Poisson‐disk sampling. We use an order of magnitude less memory and time... We provide a simple algorithm and data structures for d-dimensional unbiased maximal Poisson-disk sampling. We use an order of magnitude less memory and time... |
SourceID | proquest crossref wiley istex |
SourceType | Aggregation Database Publisher |
StartPage | 785 |
SubjectTerms | Algorithms Computer graphics Computer science Computing Methodologies [I.3.5]: Computer Graphics-Computational Geometry and Object Modeling Delay Leaves Mathematical analysis Permissible error Quadtrees Sampling Serials Studies |
Title | A Simple Algorithm for Maximal Poisson-Disk Sampling in High Dimensions |
URI | https://api.istex.fr/ark:/67375/WNG-81KQ5TC6-T/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fj.1467-8659.2012.03059.x https://www.proquest.com/docview/1020302310 https://search.proquest.com/docview/1038300989 |
Volume | 31 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1dT9swFL1C8AIPfGxMZDDkSRNvqZrEcZLHql2BTUWDtoI3y3aTEnUkqB9SxRM_gd-4X7J7k7a0gwc08RYlthX7-uae6xwfA3zDiMIRiYa2iarcxoin7UjHnu2SMAkGlEgntN-5dSHOuvzHjX8z4z_RXphSH2Kx4EaeUXyvycGVHr108lD4tN-ElvRw6kYVwpOOFxC7r3H1rCTFA-HPZb5JQGaV1PNqQyuRaoMGfboCQ5fBbBGNmjswmPejJKEMKpOxrpiHfyQe36eju7A9A62sVs6yPViLsw-wtSRl-BHOa6ydktIwq_3u58N0fHvHEA-zlpqmd1j3V44WzrM_j0-NdDRgbUVM9qzP0owR1YQ16JQBWrkb7UO3-b1TP7NnxzTYxsd0zXYSYzBvM7xnAgRXiacE4g5lEB0oH-GTUlEYxl7i-IiNkoBHSewmvRgTG8-thpjMf4L1LM_iA2AILnWh8BYoznkktKZyAddOz7hKCAucuUnkfanGIVeymEDSMEkaJlkMk5xacFLYblFBDQfEZgt8eX1xKkPn56XfqQvZseBoblw5c-QRtu5W6Vwlp2rB18VjdEH6r6KyOJ9QGUzzSZg1skAUlnzzy8n6aZOuPv9vxUPYpNslBfMI1sfDSfwFYdJYHxcO8Bc06gC2 |
link.rule.ids | 314,780,784,1375,27924,27925,46294,46718 |
linkProvider | Wiley-Blackwell |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT9tAEB5VcGg5lEeLMI-ySKg3R7GzXtvHKGkIj0Q8gspttbuxUytgozykiBM_gd_IL-mMnaQEeqgqbpa9u_LO7Hi-Gc9-C3CIHoUjEg1sE5a5jR5P26GOKrZLxCToUEId037nVls0r_nJjXczPQ6I9sIU_BDzhBtZRv69JgOnhPRbKw-ERxtOKKeHazcsIaBcxvsO1XfVL_9wSXFfeDOib6KQWSzr-etIC75qmcQ-WQCiL-Fs7o8aq3A7m0lRhtIvjUe6ZB5ekTy-01TX4PMUt7JqsdDW4UOUbsDKCzbDL3BcZVcJkQ2z6m0vGySjX3cMITFrqUlyh33PM1Rylj4_PtWTYZ9dKSpmT3ssSRlVm7A6HTRAybvhV7hu_OjUmvb0pAbbeBix2U5sDIZuhneNj_gqriiB0EMZBAjKQwSlVBgEUSV2PIRHsc_DOHLjboSxTcUtBxjPb8JSmqXRFjDElzonefMV5zwUWlM7n2una1wlhAXOTCfyviDkkAuBjC9JTJLEJHMxyYkF33PlzTuoQZ8K2nxP_mwfycA5vfA6NSE7FuzOtCuntjzE0d0yHa3klC04mD9GK6RfKyqNsjG1wUifuFlDC0Suyn9-OVk7atDV9v923IePzU7rTJ4dt0934BM1KSoyd2FpNBhHe4iaRvpbbg2_AWpdBNc |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT9tAEB5VRKrKofQBwiWlW6ni5ih21mvvMUoIUErEIwhuq92NnVopNspDinrqT-hv7C9hxk4CoT0g1Jsl767smR3PN-tvvwX4ghmFIxKNXCvr3MWMZ1xp4obrkzAJJhRpEtrvfNIVh5f863VwPec_0V6YUh9iueBGkVF8rynAb_vJ30EeiYD2m9CSHk5dWUM8WeHCl6Sj3z6_l5LioQgWOt-kILPK6vnnSCupqkJWn63g0IdotkhHnQ0YLl6kZKEMa9OJqdmfjzQe_8-bvoHXc9TKmuU0ewsv4uwdrD_QMnwPR012kZLUMGv-GOSjdPL9hiEgZid6lt5g39McXZxnf379bqfjIbvQRGXPBizNGHFNWJuOGaClu_EmXHb2e61Dd35Og2sDrNdcL7EWCzfL-zZEdJU0tEDgoS3CAx0gftJaRlHcSLwAwVEScpnEftKPsbJp-PUIq_ktWMvyLN4GhujSFBJvoeacS2EMtQu58frW10I44C1com5LOQ61UsaEisykyEyqMJOaObBX-G7ZQY-GRGcLA3XVPVCRd3wW9FpC9RyoLpyr5pE8xtH9Oh2s5NUd-Ly8jTFIP1Z0FudTaoN1PimzSgdE4cknP5xqHXTo6sNzO36Cl6ftjvp21D3egVfUoqRjVmFtMprGHxEyTcxuEQt3Qg8Dhg |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Simple+Algorithm+for+Maximal+Poisson-Disk+Sampling+in+High+Dimensions&rft.jtitle=Computer+graphics+forum&rft.au=Ebeida%2C+Mohamed+S&rft.au=Mitchell%2C+Scott+A&rft.au=Patney%2C+Anjul&rft.au=Davidson%2C+Andrew+A&rft.date=2012-05-01&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=31&rft.issue=2pt4&rft.spage=785&rft.epage=794&rft_id=info:doi/10.1111%2Fj.1467-8659.2012.03059.x&rft.externalDBID=NO_FULL_TEXT |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-7055&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-7055&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-7055&client=summon |