Sifted Disks
| dc.contributor.author | Ebeida, Mohamed S. | en_US |
| dc.contributor.author | Mahmoud, Ahmed H. | en_US |
| dc.contributor.author | Awad, Muhammad A. | en_US |
| dc.contributor.author | Mohammed, Mohammed A. | en_US |
| dc.contributor.author | Mitchell, Scott A. | en_US |
| dc.contributor.author | Rand, Alexander | en_US |
| dc.contributor.author | Owens, John D. | en_US |
| dc.contributor.editor | I. Navazo, P. Poulin | en_US |
| dc.date.accessioned | 2015-02-28T15:27:04Z | |
| dc.date.available | 2015-02-28T15:27:04Z | |
| dc.date.issued | 2013 | en_US |
| dc.description.abstract | We introduce the Sifted Disk technique for locally resampling a point cloud in order to reduce the number of points. Two neighboring points are removed and we attempt to find a single random point that is sufficient to replace them both. The resampling respects the original sizing function; In that sense it is not a coarsening. The angle and edge length guarantees of a Delaunay triangulation of the points are preserved. The sifted point cloud is still suitable for texture synthesis because the Fourier spectrum is largely unchanged. We provide an efficient algorithm, and demonstrate that sifting uniform Maximal Poisson-disk Sampling (MPS) and Delaunay Refinement (DR) points reduces the number of points by about 25 percent, and achieves a density about 1/3 more than the theoretical minimum. We show two-dimensional stippling and meshing applications to demonstrate the significance of the concept. | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/cgf.12071 | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.subject | I.3.5 [Computing Methodologies] | en_US |
| dc.subject | Computer Graphics | en_US |
| dc.subject | Computational Geometry and Object Modeling | en_US |
| dc.title | Sifted Disks | en_US |