THEORETICAL GUARANTEES FOR POISSON DISK SAMPLING USING PAIR CORRELATION FUNCTION

被引:0
作者
Kailkhura, Bhavya [1 ]
Thiagarajan, Araman J. [2 ]
Bremer, Peer-Timo [2 ]
Varshney, Pramod K. [1 ]
机构
[1] Syracuse Univ, Dept EECS, Syracuse, NY 13244 USA
[2] Lawrence Livermore Natl Lab, Livermore, CA USA
来源
2016 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING PROCEEDINGS | 2016年
关键词
Poisson-disk sampling; dart throwing; multidimensional sampling; maximal sampling; ALGORITHM;
D O I
暂无
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
In this paper, we study the problem of generating uniform random point samples on a domain of d-dimensional space based on a minimum distance criterion between point samples (Poisson-disk sampling or PDS). First, we formally define PDS via the pair correlation function (PCF) to quantitatively evaluate properties of the sampling process. Surprisingly, none of the existing PDS techniques satisfy both uniformity and minimum distance criterion, simultaneously. These approaches typically create an approximate PDS with high regularity, and inherently present high risk for sample aliasing. Our new formulation based on PCF introduces a new approach to evaluate PDS properties which leads to theoretical bounds on the size of a PDS in arbitrary dimensions as well as a faster algorithm to create better quality samplings than the current PDS approaches.
引用
收藏
页码:2589 / 2593
页数:5
相关论文
共 26 条
  • [1] [Anonymous], SIGGRAPH ASIA 2012 T
  • [2] [Anonymous], P ACM SIGGRAPH S INT
  • [3] Capacity-Constrained Point Distributions: A Variant of Lloyd's Method
    Balzer, Michael
    Schloemer, Thomas
    Deussen, Oliver
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2009, 28 (03):
  • [4] Bridson Robert, 2007, SIGGRAPH 07
  • [5] Blue Noise through Optimal Transport
    de Goes, Fernando
    Breeden, Katherine
    Ostromoukhov, Victor
    Desbrun, Mathieu
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2012, 31 (06):
  • [6] A spatial data structure for fast Poisson-disk sample generation
    Dunbar, Daniel
    Humphreys, Greg
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2006, 25 (03): : 503 - 508
  • [7] k-d Darts: Sampling by k-Dimensional Flat Searches
    Ebeida, Mohamed S.
    Patney, Anjul
    Mitchell, Scott A.
    Dalbey, Keith R.
    Davidson, Andrew A.
    Owens, John D.
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2014, 33 (01):
  • [8] A Simple Algorithm for Maximal Poisson-Disk Sampling in High Dimensions
    Ebeida, Mohamed S.
    Mitchell, Scott A.
    Patney, Anjul
    Davidson, Andrew A.
    Owens, John D.
    [J]. COMPUTER GRAPHICS FORUM, 2012, 31 (02) : 785 - 794
  • [9] Efficient Maximal Poisson-Disk Sampling
    Ebeida, Mohamed S.
    Patney, Anjul
    Mitchell, Scott A.
    Davidson, Andrew A.
    Knupp, Patrick M.
    Owens, John D.
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2011, 30 (04):
  • [10] Accurate Multidimensional Poisson-Disk Sampling
    Gamito, Manuel N.
    Maddock, Steve C.
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2009, 29 (01):