PURPOSE Results in several studies have suggested that the visual evoked potential (VEP) amplitude can vary with stimulus duration. The purpose of this study was to determine whether acuity estimates obtained by extrapolation of the sweep VEP are altered by this adaptation effect. METHODS Sweep VEP data were obtained from 16 healthy observers under binocular viewing conditions. Data were acqu...

We examine the space requirement for the classic linesegment intersection problem. Using so-called implicit data structures, we show how to make the standard sweep-line algorithm run in O((n+ k) log n) time with only O(log n) extra space, where n is the number of line segments and k is the number of intersections. If division is allowed and input can be destroyed, the algorithm can run in O((n ...

We investigate quantitatively the effect of inclined and intersecting discontinuous shales on horizontal waterfloods, using generic, dimensionless twoand three-dimensional models. We focus upon whether the shales alter the sweep efficiency. We find that they have a significant effect only if they are continuous over large areas of the bedding surfaces and are steeply inclined to the flow, or if...

The skyline operator is a well established database primitive which is traditionally applied in a way that only a single skyline is computed. In this paper we use multiple skylines themselves as objects for data exploration and data mining. We define a novel similarity measure for comparing different skylines, called SkyDist. SkyDist can be used for complex analysis tasks such as clustering, cl...

The objective of this paper is to examine the application of the Half-Sweep Geometric Mean (HSGM) method by using the half-sweep approximation equation based on quadrature formula to solve linear integral equations of Fredholm type. The formulation and implementation of the Full-Sweep Geometric Mean (FSGM) and HalfSweep Geometric Mean (HSGM) methods are also presented. Some numerical tests were...

Given a convex region in the plane, and a sweep-line as a tool, what is best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by orthogonal sweeps was first studied in [2]. Here we consider the following slanted variant of sweeping recently introduced in [1]: In a single sweep, the sweep-line is placed at a start position somewhere in the plane,...

The objective of a sweep coverage problem is to find the minimum number of mobile sensors to ensure the periodic monitoring for a given set of points of interest. In this paper we have remarked on the flaw of approximation algorithms proposed in the paper [1] for sweep coverage with mobile sensors and proposed a 3-approximation algorithm to guarantee sweep coverage with mobile and static sensors.

Two novel applications of the plane sweep paradigm are demonstrated, namely, for the computation of extended viewsheds on gridded DEMs and for class interval selection on TIN-based DEMs. In both cases, the e ciency of the plane sweep algorithm is signi cantly better than a straightforward approach. The algorithms are presented by rst giving the plane sweep method as a general approach that requ...