Sciweavers

478 search results - page 47 / 96
» Convexity minimizes pseudo-triangulations
Sort
View
CCCG
2009
13 years 9 months ago
Optimal Empty Pseudo-Triangles in a Point Set
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher
ICIP
2005
IEEE
14 years 9 months ago
Finding the global minimum for binary image restoration
Restoring binary images is a problem which arises in various application fields. In our paper, this problem is considered in a variational framework: the sought-after solution min...
Tony F. Chan, Selim Esedoglu, Mila Nikolova
ICIP
2000
IEEE
14 years 11 days ago
Vector Probability Diffusion
Minimal surface regularization has been used in several applications ranging from stereo to image segmentation, sometimes hidden as a graph-cut discrete formulation, or as a stric...
Alvaro Pardo, Guillermo Sapiro
CCCG
2010
13 years 9 months ago
Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
Yonit Bousany, Mary Leah Karker, Joseph O'Rourke, ...
ECAI
2008
Springer
13 years 9 months ago
Generating Diagnoses from Conflict Sets with Continuous Attributes
Abstract. Many techniques in model-based diagnosis and other research fields find the hitting sets of a group of sets. Existing techniques apply to sets of finite elements only. Th...
Emmanuel Benazera, Louise Travé-Massuy&egra...