Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Nearest-neighbor searching under uncertainty II
Nearest-neighbor search, which returns the nearest neighbor of a query point in a set of
points, is an important and widely studied problem in many fields, and it has a wide range of …
points, is an important and widely studied problem in many fields, and it has a wide range of …
Delaunay triangulations of imprecise pointsin linear time after preprocessing
An assumption of nearly all algorithms in computational geometry is that the input points are
given precisely, so it is interesting to ask what is the value of imprecise information about …
given precisely, so it is interesting to ask what is the value of imprecise information about …
Delaunay triangulations in O(sort(n)) time and more
We present several results about Delaunay triangulations (DTs) and convex hulls in
transdichotomous and hereditary settings:(i) the DT of a planar point set can be computed in …
transdichotomous and hereditary settings:(i) the DT of a planar point set can be computed in …
[HTML][HTML] Computing the Fréchet distance between uncertain curves in one dimension
We consider the problem of computing the Fréchet distance between two curves for which
the exact locations of the vertices are unknown. Each vertex may be placed in a given …
the exact locations of the vertices are unknown. Each vertex may be placed in a given …
[HTML][HTML] Closest pair and the post office problem for stochastic points
Given a (master) set M of n points in d-dimensional Euclidean space, consider drawing a
random subset that includes each point mi∈ M with an independent probability p i. How …
random subset that includes each point mi∈ M with an independent probability p i. How …
Preprocessing imprecise points for Delaunay triangulation: Simplified and extended
Suppose we want to compute the Delaunay triangulation of a set P whose points are
restricted to a collection ℛ of input regions known in advance. Building on recent work by …
restricted to a collection ℛ of input regions known in advance. Building on recent work by …
Fréchet distance for uncertain curves
In this article, we study a wide range of variants for computing the (discrete and continuous)
Fréchet distance between uncertain curves. An uncertain curve is a sequence of uncertainty …
Fréchet distance between uncertain curves. An uncertain curve is a sequence of uncertainty …
Unions of onions: Preprocessing imprecise points for fast onion decomposition
Let $\mathcal {D} $ be a set of $ n $ pairwise disjoint unit disks in the plane. We describe
how to build a data structure for $\mathcal {D} $ so that for any point set $ P $ containing …
how to build a data structure for $\mathcal {D} $ so that for any point set $ P $ containing …
Preprocessing ambiguous imprecise points
Let ${R}=\{R_1, R_2,..., R_n\} $ be a set of regions and let $ X=\{x_1, x_2,..., x_n\} $ be an
(unknown) point set with $ x_i\in R_i $. Region $ R_i $ represents the uncertainty region of …
(unknown) point set with $ x_i\in R_i $. Region $ R_i $ represents the uncertainty region of …
Computing hereditary convex structures
Color red and blue the n vertices of a convex polytope P in R3. Can we compute the convex
hull of each color class in o (n log n)? What if we have k> 2 colors? What if the colors are …
hull of each color class in o (n log n)? What if we have k> 2 colors? What if the colors are …