Sciweavers

371 search results - page 53 / 75
» Algorithms for the transportation problem in geometric setti...
Sort
View
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 2 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
ECCV
2004
Springer
14 years 9 months ago
Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickin...
COMPGEOM
2004
ACM
14 years 1 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...

Publication
234views
14 years 5 months ago
Robust Topological Operations for Dynamic Explicit Surfaces
We present a solution to the mesh tangling problem in surface tracking. Using an explicit triangle mesh to track the location of a surface as it moves in three dimensions has many ...
Tyson Brochu, Robert Bridson
TOG
2008
130views more  TOG 2008»
13 years 7 months ago
Quadrilateral mesh simplification
We introduce a simplification algorithm for meshes composed of quadrilateral elements. It is reminiscent of edge-collapse based methods for triangle meshes, but takes a novel appr...
Joel Daniels II, Cláudio T. Silva, Jason Sh...