Related papers: Fast, High Precision Ray/Fiber Intersection using …
Computation of bounding boxes is a fundamental problem in high performance rendering, as it is an input to visibility culling and binning operations. In a scene description structured as a tree, clip nodes and blend nodes entail…
Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…
We initiate the study of diameter computation in geometric intersection graphs from the fine-grained complexity perspective. A geometric intersection graph is a graph whose vertices correspond to some shapes in $d$-dimensional Euclidean…
The kd-tree and Bounding Volume Hierarchy (BVH) are well-known data structures for computing ray-object intersections. Less known is the Constrained Convex Space Partitioning (CCSP), which partitions space and makes the geometric primitives…
As computational complexity in electromagnetics increases with frequency, full-wave solvers become computationally infeasible for electrically large problems. To address this limitation, we present a shooting and bouncing rays (SBR) method…
Generating intelligent robot behavior in contact-rich settings is a research problem where zeroth-order methods currently prevail. Developing methods that make use of first/second order information about rigid-body dynamics in the presence…
In this paper, we discuss an efficient algorithm for computing the growth distance between two compact convex sets with representable support functions. The growth distance between two sets is the minimum scaling factor such that the sets…
Region extraction is a very common task in both Computer Science and Engineering with several applications in object recognition and motion analysis, among others. Most of the literature focuses on regions delimited by straight lines, often…
We present a new fiber assignment algorithm for a robotic fiber positioner system in multi-object spectroscopy. Modern fiber positioner systems typically have overlapping patrol regions, resulting in the number of observable targets being…
Image Fusion, a technique which combines complimentary information from different images of the same scene so that the fused image is more suitable for segmentation, feature extraction, object recognition and Human Visual System. In this…
A concise and highly performant branchless formulation of a Joseph-type interpolating ray-casting algorithm for the computation of X-ray projections is presented. It efficiently utilizes the hardware resources of modern graphics processing…
The problem of counting collisions or interactions is common in areas as computer graphics and scientific simulations. Since it is a major bottleneck in applications of these areas, a lot of research has been carried out on such subject,…
When approaching a novel visual recognition problem in a specialized image domain, a common strategy is to start with a pre-trained deep neural network and fine-tune it to the specialized domain. If the target domain covers a smaller visual…
This paper presents a set of simple and intuitive robot collision detection algorithms that show substantial scaling improvements for high geometric complexity and large numbers of collision queries by leveraging hardware-accelerated ray…
The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the…
Bundling crossings is a strategy which can enhance the readability of drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main…
The article proposes a new method for finding the triangle-triangle intersection in 3D space, based on the use of computer graphics algorithms -- cutting off segments on the plane when moving and rotating the beginning of the coordinate…
This paper proposes a method for computing the visible occluding contours of subdivision surfaces. The paper first introduces new theory for contour visibility of smooth surfaces. Necessary and sufficient conditions are introduced for when…
While well-known methods to list the intersections of either a list of segments or a complex polygon aim at achieving optimal time-complexity they often do so at the cost of memory comsumption and complex code. Real-life software…
In computed tomography, the approximation quality of a scan of a physical object is typically limited by the acquisition modalities, especially the hardware including X-ray detectors. To improve upon this, we experiment with a…