165 search results - page 9 / 33 » Computing hereditary convex structures |
Lecture Notes
These lecture notes cover several topics such as Topological Space, Metric Space, Convex Sets, Correspondences, Maximum Theorem, KKM Theorem, Existence of Maximal Element, Selectio...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
SCIA
2009
Springer
14 years 2 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
CCCG
2008
13 years 9 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...