7351 search results - page 55 / 1471 » Segmenting Point Sets |
JC
2000
13 years 9 months ago
2000
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
CCCG
2007
13 years 11 months ago
2007
We consider the problem of determining the placement of a star R on a set P of n points in the plane such that a given objective function is maximized. A star R is a set of m rays...
JSCIC
2008
13 years 10 months ago
2008
Abstract Level set methods have been used in a great number of applications in R2 and R3 and it is natural to consider extending some of these methods to problems defined on surfac...
ESA
2009
Springer
14 years 4 months ago
2009
Springer
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...
SIAMCOMP
1998
13 years 9 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...