Sciweavers

1387 search results - page 11 / 278
» Convexity in Discrete Space
Sort
View
COMPGEOM
1998
ACM
13 years 11 months ago
A General Framework for Assembly Planning: The Motion Space Approach
Dan Halperin, Jean-Claude Latombe, Randall H. Wils...
SIAMCOMP
2008
95views more  SIAMCOMP 2008»
13 years 7 months ago
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
Nir Halman
MOR
2006
93views more  MOR 2006»
13 years 7 months ago
Optimization of Convex Risk Functions
We consider optimization problems involving convex risk functions. By employing techniques of convex analysis and optimization theory in vector spaces of measurable functions we d...
Andrzej Ruszczynski, Alexander Shapiro
DCG
2007
102views more  DCG 2007»
13 years 7 months ago
How to Exhibit Toroidal Maps in Space
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
Dan Archdeacon, C. Paul Bonnington, Joanna A. Elli...
ORDER
2007
95views more  ORDER 2007»
13 years 7 months ago
A Half-Space Approach to Order Dimension
The aim of the present paper is to investigate the half-spaces in the convexity structure of all quasiorders on a given set and to use them in an alternative approach to the dimens...
Stephan Foldes, Jenö Szigeti