In general, are continuous or discrete problems easier to solve, or does it just depend on the problem too much?
sm022
How frequent are discrete optimization problems in computer graphics? It seems that lots of situations we encounter are in terms of continuous objectives, so I'm curious of some discrete examples
ShallowDream
what does "best" mean? Like fastest? Not overcoocked or undercooked? most tasty? according to whom?
Starboy
Since discrete problems can be transferred into a continuous version with additional constraints, should we put more emphasis on the continuous problem solution?
jonasjiang
Is there any problem that only has a discrete version but not a continuous one?
tianez
Is it possible to convert some discrete optimization problems into a continuous equivalent problem. I was thinking about things similar to generating discrete random values through CDF.
dl123
which is the most common type of optimization problem in graphics?
MrRockefeller
What’s the chances we counter continuous/discrete optimization problem in cg?
ant123
If we can convert a discrete problem to a continuous version, which version would be better to use? Is discrete optimization generally easier because of the restricted domain?
Kaxano
What discrete optimization problems do we encounter in computer graphics?
TejasFX
Do we encounter one of these more often in Computer Graphics? Also, although its logical that we can transform a discrete problem into a continuous problem by adding additional constraints (i.e branch and bound), but is this always desired since it adds additional complexity?
Coyote
Are there any clever strategies for continuous problems?
kurt
What is the implication of NP-hard here?
anon
What other major classes of 'easy' problems exist besides convex ones for the continuous domain? Would they all be some sort of subset of convex classes?
Concurrensee
Is it possible to make a discrete problem into a continuous problem?
air54321
When given a continuous problem, do we attempt to solve it by approximately it discretely? Can we assume that there are corresponding discrete/continuous problems?
L1TTLEM4N
Does converting continuous problems into discrete problems make them easier to solve?
spidey
Are more problems we deal with in computer graphics discrete or continuous? Is it better to leave a discrete problem as is or is converting it into a continuous problem better?
In general, are continuous or discrete problems easier to solve, or does it just depend on the problem too much?
How frequent are discrete optimization problems in computer graphics? It seems that lots of situations we encounter are in terms of continuous objectives, so I'm curious of some discrete examples
what does "best" mean? Like fastest? Not overcoocked or undercooked? most tasty? according to whom?
Since discrete problems can be transferred into a continuous version with additional constraints, should we put more emphasis on the continuous problem solution?
Is there any problem that only has a discrete version but not a continuous one?
Is it possible to convert some discrete optimization problems into a continuous equivalent problem. I was thinking about things similar to generating discrete random values through CDF.
which is the most common type of optimization problem in graphics?
What’s the chances we counter continuous/discrete optimization problem in cg?
If we can convert a discrete problem to a continuous version, which version would be better to use? Is discrete optimization generally easier because of the restricted domain?
What discrete optimization problems do we encounter in computer graphics?
Do we encounter one of these more often in Computer Graphics? Also, although its logical that we can transform a discrete problem into a continuous problem by adding additional constraints (i.e branch and bound), but is this always desired since it adds additional complexity?
Are there any clever strategies for continuous problems?
What is the implication of NP-hard here?
What other major classes of 'easy' problems exist besides convex ones for the continuous domain? Would they all be some sort of subset of convex classes?
Is it possible to make a discrete problem into a continuous problem?
When given a continuous problem, do we attempt to solve it by approximately it discretely? Can we assume that there are corresponding discrete/continuous problems?
Does converting continuous problems into discrete problems make them easier to solve?
Are more problems we deal with in computer graphics discrete or continuous? Is it better to leave a discrete problem as is or is converting it into a continuous problem better?