Sciweavers

70 search results - page 4 / 14
» Convex Hulls in a 3-Dimensional Space
Sort
View
SIAMJO
2000
113views more  SIAMJO 2000»
14 years 11 months ago
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
Masakazu Kojima, Levent Tunçel
100
Voted
DIMACS
2001
15 years 1 months ago
Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons
Abstract. One-degree-of-freedom mechanisms induced by minimum pseudotriangulations with one convex hull edge removed have been recently introduced by the author to solve a family o...
Ileana Streinu
80
Voted
EOR
2002
87views more  EOR 2002»
14 years 11 months ago
On the finite convergence of successive SDP relaxation methods
Let F be a subset of the n-dimensional Euclidean space Rn represented in terms of a compact convex subset C0 and a set PF of nitely or in nitely many quadratic functions on Rn such...
Masakazu Kojima, Levent Tunçel
ISAAC
2007
Springer
80views Algorithms» more  ISAAC 2007»
15 years 5 months ago
Geometric Streaming Algorithms with a Sorting Primitive
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
Eric Y. Chen
ICPR
2010
IEEE
15 years 4 months ago
Large Margin Classifier Based on Affine Hulls
This paper introduces a geometrically inspired large-margin classifier that can be a better alternative to the Support Vector Machines (SVMs) for the classification problems with ...
Hakan Cevikalp, Hasan Serhan Yavuz