Related papers: On the Precision to Sort Line-Quadric Intersection…
We present convergence theory for corrected quadrature rules on uniform Cartesian grids for functions with a point singularity. We begin by deriving an error estimate for the punctured trapezoidal rule, and then derive error expansions. We…
We consider several problems that involve lines in three dimensions, and present improved algorithms for solving them. The problems include (i) ray shooting amid triangles in $R^3$, (ii) reporting intersections between query lines…
We present in detail a calculation of the next-to-leading order QCD corrections to the process $e^+e^-\to 3$ jets with massive quarks. To isolate the soft and collinear divergencies of the four parton matrix elements, we modify the phase…
This work, which may be seen as a companion paper to \cite{RS2}, handles the way the intersection points made by the diagonals of a regular polygon are distributed. It was stated recently by the authors that these points lie exclusively on…
Neutrino-nucleus cross section uncertainties are expected to be a dominant systematic in future accelerator neutrino experiments. The cross sections are determined by the linear response of the nucleus to the weak interactions of the…
We present a detailed calculation of next-to-leading order QCD corrections to the $tW$ associated production using the one cutoff phase space slicing method. Such QCD corrections have been calculated independently by two groups already,…
Classes of pairs of ternary quadratic forms parametrize quartic rings by a result of Bhargava. We give an algorithm for finding a pair of ternary quadratic forms that parametrize a given order of a quartic field. We examine a new technique,…
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…
We study the four channels associated with neutrino-deuteron breakup reactions at next-to-next to leading order in effective field theory. We find that the total cross-section is indeed converging for neutrino energies up to 20 MeV, and…
We describe simple linear time algorithms for coloring the squares of balanced and unbalanced quadtrees so that no two adjacent squares are given the same color. If squares sharing sides are defined as adjacent, we color balanced quadtrees…
In this paper, we extend several time reversible numerical integrators to solve the Lorentz force equations from second order accuracy to higher order accuracy for relativistic charged particle tracking in electromagnetic fields. A fourth…
We provide formulas for the degrees of the projections of the locus of square matrices with given rank from linear spaces spanned by a choice of matrix entries. The motivation for these computations stem from applications to `matrix…
Collider data can play an important role in determining the parton distribution functions of the nucleon. I present a formalism which makes it possible to use next-to-leading order calculations in such a determination, while minimizing the…
Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…
Current phenomenological studies of jet observables at colliders are clearly limited by the theoretical uncertainties inherent in the next-to-leading order QCD description. We discuss the recent progress made towards the calculation of QCD…
We present a new parton model approach for nuclear collisions at RHIC energies (and beyond). It is a selfconsistent treatment, using the same formalism for calculating cross sections like the total and the inelastic one and, on the other…
A common approach to compute distances on continuous surfaces is by considering a discretized polygonal mesh approximating the surface and estimating distances on the polygon. We show that exact geodesic distances restricted to the polygon…
A method is developed to calculate collision probability in this paper. Based on the encounter geometric features of space objects, it is reasonable to separate the radial orbital motions from that in the cross section for most encounter…
Drawings of non-planar graphs always result in edge crossings. When there are many edges crossing at small angles, it is often difficult to follow these edges, because of the multiple visual paths resulted from the crossings that slow down…
We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at…