Zobrazeno 1 - 10
of 1 055
pro vyhledávání: '"P. Aronov"'
It is unlikely that the discrete Fr\'echet distance between two curves of length $n$ can be computed in strictly subquadratic time. We thus consider the setting where one of the curves, $P$, is known in advance. In particular, we wish to construct da
Externí odkaz:
http://arxiv.org/abs/2404.04065
Let $d$ be a (well-behaved) shortest-path metric defined on a path-connected subset of $\mathbb{R}^2$ and let $\mathcal{D}=\{D_1,\ldots,D_n\}$ be a set of geodesic disks with respect to the metric $d$. We prove that $\mathcal{G}^{\times}(\mathcal{D})
Externí odkaz:
http://arxiv.org/abs/2403.04905
An eight-partition of a finite set of points (respectively, of a continuous mass distribution) in $\mathbb{R}^3$ consists of three planes that divide the space into $8$ octants, such that each open octant contains at most $1/8$ of the points (respect
Externí odkaz:
http://arxiv.org/abs/2403.02627
Given a function $f$ from the set $[N]$ to a $d$-dimensional integer grid, we consider data structures that allow efficient orthogonal range searching queries in the image of $f$, without explicitly storing it. We show that, if $f$ is of the form $[N
Externí odkaz:
http://arxiv.org/abs/2311.12471
Autor:
I. Z. Aronov, O. V. Maksimova
Publikováno v:
Vestnik MGIMO-Universiteta, Vol 17, Iss 4, Pp 83-100 (2024)
Contemporary international relations, anchored in the principles of multipolarity, frequently employ consensus-based decision-making, which prioritizes respect for all negotiating parties and ensures that the views of all participants are considered
Externí odkaz:
https://doaj.org/article/dc8489690b5249a9bb502eefd000a8f9
Autor:
D. M. Aronov, M. G. Bubnova
Publikováno v:
Рациональная фармакотерапия в кардиологии, Vol 20, Iss 2, Pp 233-240 (2024)
The results of studies investigating the clinical effects of cardiac rehabilitation (CR) in patients after acute myocardial infarction (MI) and cardiovascular surgery are discussed. It is known that CR programs vary in duration and dose (number of tr
Externí odkaz:
https://doaj.org/article/1e86e866846f4a33a58eddb6fe6dac79
Publikováno v:
Computing in Geometry and Topology, 2.1(2023), 9:1-9:20
Let $L$ be a set of $n$ axis-parallel lines in $\mathbb{R}^3$. We are are interested in partitions of $\mathbb{R}^3$ by a set $H$ of three planes such that each open cell in the arrangement $\mathcal{A}(H)$ is intersected by as few lines from $L$ as
Externí odkaz:
http://arxiv.org/abs/2204.01772
Let $\mathcal{T}$ be a set of $n$ flat (planar) semi-algebraic regions in $\mathbb{R}^3$ of constant complexity (e.g., triangles, disks), which we call plates. We wish to preprocess $\mathcal{T}$ into a data structure so that for a query object $\gam
Externí odkaz:
http://arxiv.org/abs/2203.10241
Autor:
Olga V. Maksimova, Iosif Z. Aronov
Publikováno v:
International Journal of Mathematical, Engineering and Management Sciences, Vol 9, Iss 1, Pp 71-89 (2024)
The complexity of formalizing negotiation procedures leads to the search for fundamentally new approaches to building mathematical models. The theoretical study of consensus makes it possible to analyze various situations encountered by social groups
Externí odkaz:
https://doaj.org/article/101afc772ce74cc09ede88d3200f8c62
We present subquadratic algorithms in the algebraic decision-tree model for several \textsc{3Sum}-hard geometric problems, all of which can be reduced to the following question: Given two sets $A$, $B$, each consisting of $n$ pairwise disjoint segmen
Externí odkaz:
http://arxiv.org/abs/2109.07587