Maximal Poisson-disk Sampling via Sampling Radius Optimization

doi:http://dx.doi.org/10.1145/3005274.3005281

CASIA OpenIR > 多模态人工智能系统全国重点实验室 > 三维可视计算

	Maximal Poisson-disk Sampling via Sampling Radius Optimization
	Quan, Weize; Yan, Dong-Ming; Guo, Jianwei; Meng, Weiliang; Zhang, Xiaopeng
	2016-12
会议名称	ACM SIGGRAPH Asia
会议日期	December 05-08, 2016
会议地点	Macao
摘要	Maximal Poisson-disk Sampling (MPS) is a fundamental research topic in computer graphics. An ideal MPS pattern should satisfy three properties: bias-free, minimal distance, maximal coverage. The classic approach for generating MPS is dart throwing, but this method is unable to precisely control the number of samples when achieving maximality [Ebeida et al. 2011]. Sample elimination [Yuksel 2015] is an recently proposed algorithm that could generate Poisson-disk sets with an exactly desired size, but it cannot guarantee the maximal coverage. In this work, we propose a simple 2D MPS algorithm that can precisely control the number of samples, while meeting all three criteria simultaneously. Unlike previous conflict-based methods, our algorithm controls the number of samples by dynamically adjusting sampling radius.
DOI	http://dx.doi.org/10.1145/3005274.3005281
收录类别	EI
引用统计
文献类型	会议论文
条目标识符	http://ir.ia.ac.cn/handle/173211/13996
专题	多模态人工智能系统全国重点实验室_三维可视计算
通讯作者	Yan, Dong-Ming
推荐引用方式 GB/T 7714	Quan, Weize,Yan, Dong-Ming,Guo, Jianwei,et al. Maximal Poisson-disk Sampling via Sampling Radius Optimization[C],2016.

条目包含的文件		下载所有文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
2016_SigAsiaPoster_M（5590KB）	会议论文		开放获取	CC BY-NC-SA	浏览下载