Sciweavers

1387 search results - page 12 / 278
» Convexity in Discrete Space
Sort
View
IWCIA
2004
Springer
14 years 26 days ago
Convex Hulls in a 3-Dimensional Space
This paper describes a new algorithm of computing the convex hull of a 3-dimensional object. The convex hull generated by this algorithm stract polyhedron being described by a new ...
Vladimir Kovalevsky, Henrik Schulz
COMPGEOM
2008
ACM
13 years 9 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
DGCI
2008
Springer
13 years 9 months ago
Geometric Feature Estimators for Noisy Discrete Surfaces
Abstract. We present in this paper robust geometric feature estimators on the border of a possibly noisy discrete object. We introduce the notion of patch centered at a point of th...
Laurent Provot, Isabelle Debled-Rennesson
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
13 years 11 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
DATE
2009
IEEE
129views Hardware» more  DATE 2009»
14 years 2 months ago
Energy minimization for real-time systems with non-convex and discrete operation modes
—We present an optimal methodology for dynamic voltage scheduling problem in the presence of realistic assumption such as leakage-power and intra-task overheads. Our contribution...
Foad Dabiri, Alireza Vahdatpour, Miodrag Potkonjak...