Sciweavers

307 search results - page 35 / 62
» The convex hull of ellipsoids
Sort
View
CA
1996
IEEE
13 years 11 months ago
Efficient And Accurate Interference Detection For Polynomial Deformation
We present efficient and accurate algorithms for interference detection among objects undergoing polynomial deformation. The scope of our algorithms include physically-based model...
Merlin Hughes, Christopher DiMattia, Ming C. Lin, ...
CCCG
2008
13 years 9 months ago
A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model
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 ...
Yurai Núñez Rodríguez, Henry ...
IPCO
2004
93views Optimization» more  IPCO 2004»
13 years 9 months ago
Semi-continuous Cuts for Mixed-Integer Programming
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
I. R. de Farias
CORR
2004
Springer
102views Education» more  CORR 2004»
13 years 7 months ago
Unfolding Smooth Primsatoids
Nadia Benbernou Patricia Cahn Joseph O'Rourke We define a notion for unfolding smooth, ruled surfaces, and prove that every smooth prismatoid (the convex hull of two smooth ...
Nadia Benbernou, Patricia Cahn, Joseph O'Rourke
COMBINATORICA
2010
13 years 5 months ago
Formulae and growth rates of high-dimensional polycubes
A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper d-dimens...
Ronnie Barequet, Gill Barequet, Günter Rote