164 search results - page 12 / 33 » Adaptive Algorithms for Planar Convex Hull Problems |
KDD
2009
ACM
16 years 9 days ago
2009
ACM
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
158
click to vote
CAD
2011
Springer
14 years 6 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
100
click to vote
WADS
1997
Springer
15 years 3 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
100
click to vote
DAM
2008
14 years 12 months ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
DAM
2007
14 years 11 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...