Sciweavers

31 search results - page 3 / 7
» How Good are Convex Hull Algorithms
Sort
View
104
Voted
VMV
2008
151views Visualization» more  VMV 2008»
15 years 4 months ago
Adaptive surface decomposition for the distance computation of arbitrarily shaped objects
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
Marc Gissler, Matthias Teschner
SIAMIS
2010
283views more  SIAMIS 2010»
14 years 10 months ago
A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Var...
Ernie Esser, Xiaoqun Zhang, Tony F. Chan
BIRTHDAY
2003
Springer
15 years 8 months ago
Java Applets for the Dynamic Visualization of Voronoi Diagrams
We discuss the design of Java applets that visualize how the Voronoi diagram of n points continuously changes as individual points are moved across the plane, or as the underlying...
Christian Icking, Rolf Klein, Peter Köllner, ...
CVPR
2001
IEEE
16 years 5 months ago
Convex and Non-convex Illuminant Constraints for Dichromatic Colour Constancy
The dichromatic reflectance model introduced by Shafer [16] predicts that the colour signals of most materials fall on a plane spanned by a vector due to the material and a vector...
Graham D. Finlayson, Gerald Schaefer
128
Voted
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 7 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...