Sciweavers

22 search results - page 3 / 5
» A Comparison of Two Fully-Dynamic Delaunay Triangulation Met...
Sort
View
COMPGEOM
2010
ACM
13 years 9 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
ECCV
2008
Springer
14 years 7 months ago
Anisotropic Geodesics for Perceptual Grouping and Domain Meshing
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
Sébastien Bougleux, Gabriel Peyré, L...
ICCAD
2005
IEEE
110views Hardware» more  ICCAD 2005»
14 years 2 months ago
Computational geometry based placement migration
Placement migration is a critical step to address a variety of postplacement design closure issues, such as timing, routing congestion, signal integrity, and heat distribution. To...
Tao Luo, Haoxing Ren, Charles J. Alpert, David Zhi...
CVPR
2005
IEEE
14 years 7 months ago
Object Detection Using 2D Spatial Ordering Constraints
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
Yan Li, Yanghai Tsin, Yakup Genc, Takeo Kanade
ISVC
2007
Springer
13 years 12 months ago
Interactive Glyph Placement for Tensor Fields
Visualization of glyphs has a long history in medical imaging but gains much more power when the glyphs are properly placed to fill the screen. Glyph packing is often performed vi...
Mario Hlawitschka, Gerik Scheuermann, Bernd Hamann