Results 221 to 230 of about 55,398 (262)
Some of the next articles are maybe not open access.
ACM Transactions on Graphics, 2020
In scenes lit with sharp point-like light sources, light can bounce several times on specular materials before getting into our eyes, forming purely specular light paths. However, to our knowledge, rendering such multi-bounce pure specular paths has not been handled in previous work: while many light transport methods have been devised to sample ...
Beibei Wang 0002 +2 more
openaire +1 more source
In scenes lit with sharp point-like light sources, light can bounce several times on specular materials before getting into our eyes, forming purely specular light paths. However, to our knowledge, rendering such multi-bounce pure specular paths has not been handled in previous work: while many light transport methods have been devised to sample ...
Beibei Wang 0002 +2 more
openaire +1 more source
Memoirs of the American Mathematical Society, 1999
Introduction Preliminaries Decomposition of Bessel processes Random walk estimates Estimates for approximate points of increase Two and three angle estimates The main estimate Estimates for wedges Filling in the gaps Further results and problems References.
Burdzy, Krzysztof, Bass, Richard F.
openaire +1 more source
Introduction Preliminaries Decomposition of Bessel processes Random walk estimates Estimates for approximate points of increase Two and three angle estimates The main estimate Estimates for wedges Filling in the gaps Further results and problems References.
Burdzy, Krzysztof, Bass, Richard F.
openaire +1 more source
2019
We define the (random) \(k\)-cut number of a rooted graph to model the difficulty of the destruction of a resilient network. The process is as the cut model of Meir and Moon [14] except now a node must be cut \(k\) times before it is destroyed. The first order terms of the expectation and variance of \(\mathcal{X}_n\), the \(k\)-cut number of a path of
Xing Shi Cai +3 more
openaire +1 more source
We define the (random) \(k\)-cut number of a rooted graph to model the difficulty of the destruction of a resilient network. The process is as the cut model of Meir and Moon [14] except now a node must be cut \(k\) times before it is destroyed. The first order terms of the expectation and variance of \(\mathcal{X}_n\), the \(k\)-cut number of a path of
Xing Shi Cai +3 more
openaire +1 more source
A Branch-and-Cut Algorithm for the Median-Path Problem
Computational Optimization and Applications, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pasquale Avella +3 more
openaire +3 more sources
Exact approaches for the cutting path determination problem
Computers & Operations Research, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Everton Fernandes da Silva +3 more
openaire +1 more source
Straightest Paths on Meshes by Cutting Planes
2006Geodesic paths and distances on meshes are used for many applications such as parameterization, remeshing, mesh segmentation, and simulations of natural phenomena. Noble works to compute shortest geodesic paths have been published. In this paper, we present a new approach to compute the straightest path from a source to one or more vertices on a ...
Sungyeol Lee, Joonhee Han, Haeyoung Lee
openaire +1 more source
A path planner for the cutting of nested irregular layouts
1989A combinatorial path planning problem arises when trying to cut optimally a layout of nested irregular forms. Heuristic search techniques coming from AI and OR are applied to build an approximate resolution method. Results for "real-life" instances (clothing layouts in the apparel industry) are presented and evaluated.
José Távora, Helder Coelho
openaire +1 more source
Laser Cutting Path Planning Using CP
2013Sheet metal cutting using lasers is ubiquitous in the industry, and is used to produce everything from home decorations to excavator scoops. Metal waste is costly for the industry, both in terms of money, but also in terms of an increased environmental footprint.
Mikael Z. Lagerkvist +2 more
openaire +1 more source
Optimization of Non-Cutting Tool Paths
Advanced Materials Research, 2011The focus of CAM systems is on effectively creating cutting tool paths. However, collision risk is very high on multi axes machines when performing non-cutting traverse moves. If available, CAM systems offer limited setting options for non-cutting tool moves.
Berend Denkena +2 more
openaire +1 more source
Minimax trees, paths, and cut sets
Naval Research Logistics Quarterly, 1983AbstractThe notions of minimax paths, trees, and cut sets are defined for undirected graphs; and relationships between these entities are established. Simple solution procedures based on these relationships are presented.
Corley, H. W., Golnabi, H.
openaire +1 more source