Sciweavers

1672 search results - page 270 / 335
» Tightness problems in the plane
Sort
View
163
Voted
SI3D
2005
ACM
15 years 11 months ago
Sketching mesh deformations
Techniques for interactive deformation of unstructured polygon meshes are of fundamental importance to a host of applications. Most traditional approaches to this problem have emp...
Youngihn Kho, Michael Garland
SI3D
2005
ACM
15 years 11 months ago
Broad-phase collision detection using semi-adjusting BSP-trees
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
Rodrigo G. Luque, João Luiz Dihl Comba, Car...
SPAA
2005
ACM
15 years 11 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
GECCO
2005
Springer
117views Optimization» more  GECCO 2005»
15 years 11 months ago
A study of evolutionary robustness in stochastically tiled polyominos
Given an evolutionary optimization problem with many possible genotypes for each phenotype this study investigates if the evolved genes for a given phenotype are more robust to po...
Justin Schonfeld, Daniel A. Ashlock
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
15 years 11 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen