We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
We present an algorithm which robustly computes the intersection curve(s) of an under-constrained piecewise polynomial system consisting of n equations with n + 1 unknowns. The so...
We present a novel technique for approximating the boundary of a swept volume. The generator given by an input triangle mesh is rendered under all rigid transformations of a discr...
Andreas von Dziegielewski, R. Erbes, Elmar Sch&oum...
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
In region machining, neighbouring regions may be close together, but disconnected. Boundary curves may also have unwanted geometric artifacts caused by approximation and discretis...
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
Matthias Nieser, Konstantin Poelke, Konrad Polthie...
Abstract. This paper presents a method for analogizing high-dimensional spacetime curves, and shows how it can be used to transform a motion sequence into new content and styles ac...
Abstract. This paper considers the problem of computing an interpolating skin of a ordered set of discrete 2D balls. By construction, the skin is constrained to be C1 continuous, a...
Gregory G. Slabaugh, Gozde B. Unal, Tong Fang, Jar...
Afiniteelement simulationframeworkforcuttingand fracturing model without remeshing is presented. The main idea of proposed method is adding a discontinuous function for the standa...
Molecular surface computations are often necessary in order to perform synthetic drug design. A critical step in this process is the computation and update of an exact boundary re...
Chandrajit L. Bajaj, Valerio Pascucci, Robert J. H...