947 search results - page 164 / 190 » Discrete Geometry |
131
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
130
Voted
TOG
2008
15 years 3 months ago
2008
Our goal is to simulate the full hair geometry, consisting of approximately one hundred thousand hairs on a typical human head. This will require scalable methods that can simulat...
131
click to vote
CPAIOR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
141
click to vote
CPAIOR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
120
Voted
CPM
2009
Springer
15 years 10 months ago
2009
Springer
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...