Zobrazeno 1 - 10
of 146
pro vyhledávání: '"Janardan, Ravi"'
We consider a range-search variant of the closest-pair problem. Let $\varGamma$ be a fixed shape in the plane. We are interested in storing a given set of $n$ points in the plane in some data structure such that for any specified translate of $\varGa
Externí odkaz:
http://arxiv.org/abs/1807.09498
Given a dataset $S$ of points in $\mathbb{R}^2$, the range closest-pair (RCP) problem aims to preprocess $S$ into a data structure such that when a query range $X$ is specified, the closest-pair in $S \cap X$ can be reported efficiently. The RCP prob
Externí odkaz:
http://arxiv.org/abs/1712.09749
We investigate several computational problems related to the stochastic convex hull (SCH). Given a stochastic dataset consisting of $n$ points in $\mathbb{R}^d$ each of which has an existence probability, a SCH refers to the convex hull of a realizat
Externí odkaz:
http://arxiv.org/abs/1704.07028
In this paper, we study the linear separability problem for stochastic geometric objects under the well-known unipoint/multipoint uncertainty models. Let $S=S_R \cup S_B$ be a given set of stochastic bichromatic points, and define $n = \min\{|S_R|, |
Externí odkaz:
http://arxiv.org/abs/1603.07021
Publikováno v:
In Computational Geometry: Theory and Applications October 2020 90
Publikováno v:
In Computational Geometry: Theory and Applications June 2020 88
Publikováno v:
In Computational Geometry: Theory and Applications September 2019 82:16-31
Publikováno v:
In Computational Geometry: Theory and Applications October 2018 74:1-20
Publikováno v:
In Journal of Discrete Algorithms May 2017 44:1-20
Publikováno v:
In Journal of Discrete Algorithms January 2015 30:1-12