This paper presents a survey as well as a new sweep-circle algorithm, on plane sweep algorithms for computing the Delaunay triangulation. The algorithms examined are: Fortune’s sweep-line algorithm, Zalik’s sweep-line algorithm, and a sweep-circle algorithm proposed by Adam, Kauffmann, Schmitt, and Spehner. We test implementations of these algorithms on a number of uniform and none-uniform dist...

We propose a sweep-based approach to the freeform deformation of three-dimensional objects. Instead of using a volume enclosing the whole object, we approximate only its deformable parts using sweep surfaces. The vertices on the object boundary are bound to the sweep surfaces and follow their deformation. Several sweep surfaces can be organized into a hierarchy so that they interact with each o...

In this paper the control performance of the flotation process is evaluated as a function of the measurement accuracy and sampling frequency of an on-stream analyzer. First, the performance of rule-based control and model predictive control (MPC) strategies is studied using discrete flotation models and the respective performance indices. Next, the net smelter return (NSR) is calculated for var...

OBJECTIVE The spinopelvic kinematics of sweep and scull have yet to be investigated, despite evidence suggesting that sweep rowing may be provocative for low back pain (LBP). The aim of this study was to determine whether differences existed in spinopelvic kinematics in high-level rowers without LBP in sweep and scull ergometer rowing. DESIGN Repeated measures study. SETTING Institute of Sp...

Our sweep design methodology centers on creating a frequency dependent force-amplitude (drive) function such that the drive-level at each frequency is maximised but does not exceed the mechanical limitations of the vibrator. Bagaini (2008) showed how we can overcome the reduction in energy from reducing the drive-level by increasing the instantaneous sweep rate. This methodology has commonly be...

Using a multivariable Faa di Bruno formula we give conditions on transformations τ : [0, 1] → X where X is a closed and bounded subset of R such that f ◦ τ is of bounded variation in the sense of Hardy and Krause for all f ∈ C(X ). We give similar conditions for f◦τ to be smooth enough for scrambled net sampling to attain O(n−3/2+ ) accuracy. Some popular symmetric transformations to the simple...