Sciweavers

484 search results - page 26 / 97
» The number of convex permutominoes
Sort
View
CCCG
2003
13 years 11 months ago
An algorithm for the MaxMin area triangulation of a convex polygon
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
J. Mark Keil, Tzvetalin S. Vassilev
MOR
2006
95views more  MOR 2006»
13 years 10 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
ADCM
2007
100views more  ADCM 2007»
13 years 10 months ago
An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphi
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we de...
Evgeny Lipovetsky, Nira Dyn
CVPR
2010
IEEE
14 years 15 days ago
Co-clustering of Image Segments Using Convex Optimization Applied to EM Neuronal Reconstruction
This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structu...
Shiv Vitaladevuni, Ronen Basri
JC
2007
57views more  JC 2007»
13 years 10 months ago
Discrepancy with respect to convex polygons
We study the problem of discrepancy of finite point sets in the unit square with respect to convex polygons, when the directions of the edges are fixed, when the number of edges ...
W. W. L. Chen, G. Travaglini