279 search results - page 38 / 56 » Implicit Convex Polygons |
155
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
127
Voted
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
In Kernel Fisher discriminant analysis (KFDA), we carry out Fisher linear discriminant analysis in a high dimensional feature space defined implicitly by a kernel. The performance...
200
Voted
AADA
2011
14 years 3 months ago
2011
We introduce a variational approach to image segmentation based on sparse coverings of image domains by shape templates. The objective function combines a data term that achieves ...
126
Voted
ICCSA
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. This paper describes how function-based shape modeling can be expanded to web visualization, as well as how web-based visualization can be greatly improved by using the f...
110
Voted
ICNC
2005
Springer
15 years 9 months ago
2005
Springer
This paper proposes an improved genetic algorithm for producing aesthetically pleasing drawings of general undirected graphs. Previous undirected graph drawing algorithms draw larg...