Sciweavers

4761 search results - page 208 / 953
» Generalizing Boundary Points
Sort
View
SGP
2003
15 years 5 months ago
Provably Good Surface Sampling and Approximation
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
Steve Oudot, Jean-Daniel Boissonnat
CG
2005
Springer
15 years 3 months ago
Adaptive density estimation using an orthogonal series for global illumination
In Monte-Carlo photon-tracing methods energy-carrying particles are traced in an environment to generate hit points on object surfaces for simulating global illumination. The surf...
Kam Wah Wong, Wenping Wang
EJC
2008
15 years 4 months ago
A simple proof for open cups and caps
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
Jakub Cerný
ICCV
2009
IEEE
16 years 9 months ago
Scene Shape Priors for Superpixel Segmentation
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for feat...
Alastair P. Moore, Simon J. D. Prince, Jonathan Wa...
ICCV
2009
IEEE
1191views Computer Vision» more  ICCV 2009»
16 years 8 months ago
3D Open-Surface Shape Correspondence for Statistical Shape Modeling: Identifying Topologically Consistent Landmarks
Shape correspondence, which aims at accurately identifying corresponding landmarks from a given population of shape instances, is a very challenging step in constructing a statisti...
Pahal Dalal, Lili Ju, Michael McLaughlin, Xiangron...