676 search results - page 53 / 136 » A Search-Free Intersection Algorithm |
MOR
2010
13 years 8 months ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
ISAAC
1999
Springer
14 years 2 months ago
1999
Springer
This paper considers recon gurations of polygons, where each polygon edge is a rigid link, no two of which can cross during the motion. We prove that one can recon gure any monoton...
ACID
2006
13 years 11 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
DGCI
2005
Springer
14 years 3 months ago
2005
Springer
A new approach to ray tracing implicit surfaces based on recursive space subdivision is presented in this paper. Interval arithmetic, already used to calculate intersections in ray...
ESA
2003
Springer
14 years 3 months ago
2003
Springer
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...