Sciweavers

10 search results - page 2 / 2
» Efficient Reduction of L-infinity Geometry Problems
Sort
View
COMPGEOM
2001
ACM
13 years 9 months ago
The convex hull of ellipsoids
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
EAAI
2008
106views more  EAAI 2008»
13 years 5 months ago
The distributed multilevel ant-stigmergy algorithm used at the electric-motor design
This article presents an optimization method used at the electric-motor design. The goal of the optimization was to find the geometrical parameter values that would generate the r...
Peter Korosec, Jurij Silc
ENTCS
2002
101views more  ENTCS 2002»
13 years 5 months ago
Hypergeometric Functions in Exact Geometric Computation
Most problems in computational geometry are algebraic. A general approach to address nonrobustness in such problems is Exact Geometric Computation (EGC). There are now general lib...
Zilin Du, Maria Eleftheriou, José E. Moreir...
PRL
2010
188views more  PRL 2010»
13 years 3 months ago
Sparsity preserving discriminant analysis for single training image face recognition
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
Lishan Qiao, Songcan Chen, Xiaoyang Tan
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
13 years 5 months ago
Voronoi diagram computations for planar NURBS curves
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
Joon-Kyung Seong, Elaine Cohen, Gershon Elber