Mattias AnderssonJoachim GiesenMark PaulyBettina Speckmann2024-01-192024-01-192024-01-192004-06-02https://infoscience.epfl.ch/handle/20.500.14299/203049Given 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.text::conference output::conference paper not in proceedings