Bounds on the k-Neighborhood for Locally Uniformly Sampled Surfaces

Simple item page
dc.contributor.authorAndersson, Mattiasen_US
dc.contributor.authorGiesen, Joachimen_US
dc.contributor.authorPauly, Marken_US
dc.contributor.authorSpeckmann, Bettinaen_US
dc.contributor.editorMarkus Gross and Hanspeter Pfister and Marc Alexa and Szymon Rusinkiewiczen_US
dc.date.accessioned2014-01-29T16:25:42Z
dc.date.available2014-01-29T16:25:42Z
dc.date.issued2004en_US
dc.description.abstractGiven 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.description.seriesinformationSPBG'04 Symposium on Point - Based Graphics 2004en_US
dc.identifier.isbn3-905673-09-6en_US
dc.identifier.issn1811-7813en_US
dc.identifier.urihttps://doi.org/10.2312/SPBG/SPBG04/167-171en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Curve, surface, solid, and object representationsen_US
dc.titleBounds on the k-Neighborhood for Locally Uniformly Sampled Surfacesen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
167-171.pdf
Size:
647.05 KB
Format:
Adobe Portable Document Format
Download
Collections
Symposium on Point Based Graphics 04