Sciweavers

34 search results - page 4 / 7
» On the volume of sets bounded by refinable functions
Sort
View
CVGIP
2000
124views more  CVGIP 2000»
13 years 8 months ago
Hierarchical Solutions for the Deformable Surface Problem in Visualization
In this paper we present a hierarchical approach for the deformable surface technique. This technique is a three dimensional extension of the snake segmentation method. We use it ...
Christoph Lürig, Leif Kobbelt, Thomas Ertl
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
14 years 1 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
INFORMS
2008
241views more  INFORMS 2008»
13 years 8 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
IJRR
2002
129views more  IJRR 2002»
13 years 8 months ago
Deformable Free-Space Tilings for Kinetic Collision Detection
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
Pankaj K. Agarwal, Julien Basch, Leonidas J. Guiba...
COMPGEOM
2006
ACM
14 years 2 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...