Sciweavers

76 search results - page 1 / 16
» Fast approximation of convex hull
Sort
View
ACST
2006
13 years 11 months ago
Fast approximation of convex hull
Ladislav Kavan, Ivana Kolingerová, Jiri Zar...
ISBI
2004
IEEE
14 years 10 months ago
Search Space Partitioning Using Convex Hull and Concavity Features for Fast Medical Image Retrieval
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
Phillip Mlsna, Nikolay Sirakov
COMPGEOM
2005
ACM
13 years 11 months ago
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
Jonathan Richard Shewchuk
CGF
2008
128views more  CGF 2008»
13 years 10 months ago
Hierarchical Convex Approximation of 3D Shapes for Fast Region Selection
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
Marco Attene, Michela Mortara, Michela Spagnuolo, ...
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
14 years 1 months ago
Using convex hulls to represent classifier conditions
This papers presents a novel representation of classifier conditions based on convex hulls. A classifier condition is represented by a sets of points in the problem space. These p...
Pier Luca Lanzi, Stewart W. Wilson