Sciweavers

515 search results - page 19 / 103
» Classroom Examples of Robustness Problems in Geometric Compu...
Sort
View
COMPGEOM
2006
ACM
15 years 3 months ago
Envelope surfaces
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
Nico Kruithof, Gert Vegter
COMPGEOM
2010
ACM
15 years 2 months ago
The 2-center problem in three dimensions
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
PG
2007
IEEE
15 years 4 months ago
Fast and Faithful Geometric Algorithm for Detecting Crest Lines on Meshes
A new geometry-based finite difference method for a fast and reliable detection of perceptually salient curvature extrema on surfaces approximated by dense triangle meshes is pro...
Shin Yoshizawa, Alexander G. Belyaev, Hideo Yokota...
WACV
2007
IEEE
15 years 4 months ago
Nonlinear Mean Shift for Robust Pose Estimation
We propose a new robust estimator for camera pose estimation based on a recently developed nonlinear mean shift algorithm. This allows us to treat pose estimation as a clustering ...
Raghav Subbarao, Yakup Genc, Peter Meer
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
15 years 4 months ago
Generating large-scale neural networks through discovering geometric regularities
Connectivity patterns in biological brains exhibit many repeating motifs. This repetition mirrors inherent geometric regularities in the physical world. For example, stimuli that ...
Jason Gauci, Kenneth O. Stanley