Sciweavers

765 search results - page 81 / 153
» Empirical Design of Geometric Algorithms
Sort
View
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
15 years 6 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
MCS
2001
Springer
15 years 4 months ago
Finding Consistent Clusters in Data Partitions
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...
Ana L. N. Fred
DPHOTO
2010
208views Hardware» more  DPHOTO 2010»
15 years 1 months ago
A signature analysis based method for elliptical shape
The high level context image analysis regards many fields as face recognition, smile detection, automatic red eye removal, iris recognition, fingerprint verification, etc. Techniq...
Ivana Guarneri, Mirko Guarnera, Giuseppe Messina, ...
GPEM
2007
71views more  GPEM 2007»
14 years 11 months ago
Integrating generative growth and evolutionary computation for form exploration
We present a novel means of algorithmically describing a growth process that is an extension of Lindenmayer’s Map L-systems. This growth process relies upon a set of rewrite rule...
Una-May O'Reilly, Martin Hemberg
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
15 years 8 months ago
Fixed-outline Floorplanning through Better Local Search
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
Saurabh N. Adya, Igor L. Markov