Sciweavers

1387 search results - page 18 / 278
» Convexity in Discrete Space
Sort
View
ICRA
2002
IEEE
115views Robotics» more  ICRA 2002»
14 years 14 days ago
DEEP: Dual-Space Expansion for Estimating Penetration Depth Between Convex Polytopes
Abstract— We present an incremental algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a “locally optimal solution”...
Young J. Kim, Ming C. Lin, Dinesh Manocha
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
13 years 7 months ago
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
Naama Mayer, Efi Fogel, Dan Halperin
SIGECOM
2008
ACM
129views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Characterizing truthful mechanisms with convex type spaces
Aaron Archer, Robert Kleinberg
MP
1998
63views more  MP 1998»
13 years 7 months ago
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
Ya. I. Alber, Alfredo N. Iusem, Mikhail V. Solodov