dc.contributor.author | Andersson, Mattias | en_US |
dc.contributor.author | Giesen, Joachim | en_US |
dc.contributor.author | Pauly, Mark | en_US |
dc.contributor.author | Speckmann, Bettina | en_US |
dc.contributor.editor | Markus Gross and Hanspeter Pfister and Marc Alexa and Szymon Rusinkiewicz | en_US |
dc.date.accessioned | 2014-01-29T16:25:42Z | |
dc.date.available | 2014-01-29T16:25:42Z | |
dc.date.issued | 2004 | en_US |
dc.identifier.isbn | 3-905673-09-6 | en_US |
dc.identifier.issn | 1811-7813 | en_US |
dc.identifier.uri | http://dx.doi.org/10.2312/SPBG/SPBG04/167-171 | en_US |
dc.description.abstract | Given a locally uniform sample set P of a smooth surface S. We derive upper and lower bounds on the number k of nearest neighbors of a sample point p that have to be chosen from P such that this neighborhood contains all restricted Delaunay neighbors of p. In contrast to the trivial lower bound, the upper bound indicates that a sampling condition that is used in many computational geometry proofs is quite reasonable from a practical point of view. | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Curve, surface, solid, and object representations | en_US |
dc.title | Bounds on the k-Neighborhood for Locally Uniformly Sampled Surfaces | en_US |
dc.description.seriesinformation | SPBG'04 Symposium on Point - Based Graphics 2004 | en_US |