arXiv subjects

Dmitry Sokolov

Publications and source records attributed to Dmitry Sokolov.

23 records · Page 2Linked to original sources

arXiv2015

On Smooth 3D Frame Field Design

We analyze actual methods that generate smooth frame fields both in 2D and in 3D. We formalize the 2D problem by representing frames as functions (as it was done in 3D), and show that the derived optimization problem is the one that previous work obtain via "representation vectors." We show (in 2D) why this non linear optimization problem is easier to solve than directly minimizing the rotation angle of the field, and observe that the 2D algorithm is able to find good fields. Now, the 2D and the 3D optimization problems are derived from the same formulation (based on representing frames by functions). Their energies share some similarities from an optimization point of view (smoothness, local minima, bounds of partial derivatives, etc.), so we applied the 2D resolution mechanism to the 3D problem. Our evaluation of all existing 3D methods suggests to initialize the field by this new algorithm, but possibly use another method for further smoothing.

cs.GR↗

arXiv2014

Tree-like resolution complexity of two planar problems

We consider two CSP problems: the first CSP encodes 2D Sperner's lemma for the standard triangulation of the right triangle on $n^2$ small triangles; the second CSP encodes the fact that it is impossible to match cells of $n \times n$ square to arrows (two horizontal, two vertical and four diagonal) such that arrows in two cells with a common edge differ by at most $45^\circ$, and all arrows on the boundary of the square do not look outside (this fact is a corollary of the Brower's fixed point theorem). We prove that the tree-like resolution complexities of these CSPs are $2^{Θ(n)}$. For Sperner's lemma our result implies $Ω(n)$ lower bound on the number of request to colors of vertices that is enough to make in order to find a trichromatic triangle; this lower bound was originally proved by Crescenzi and Silvestri. CSP based on Sperner's lemma is related with the $\rm PPAD$-complete problem. We show that CSP corresponding to arrows is also related with a $\rm PPAD$-complete problem.

cs.CC↗

arXiv2014

Spin-polaron band of heavy carriersin the heavy-fermion ferromagnetic superconductor UGe2

In strongly correlated materials, cooperative behavior of the electrons causes a variety of quantum ordered states that may, in some cases, coexist. It has long been believed, however, that such coexistence among ferromagnetic ordering, superconductivity and heavy-fermion behavior is impossible, as the first supports parallel spin alignment while the conventional understanding of the latter two phenomena assumes spin-singlet or anti-parallel spins. This understanding has recently been challenged by an increasing number of observations in uranium systems (UGe2, URhGe, UIr and UCoGe) in which superconductivity is found within a ferromagnetic state and, more fundamentally, both ordering phenomena are exhibited by the same set of heavy 5f electrons. Since the coexistence of superconductivity and ferromagnetism is at odds with the standard theory of phonon-mediated spin-singlet superconductivity, it requires an alternative pairing mechanism, in which electrons are bound into spin-triplet pairs by spin fluctuations. Within the heavy-fermion scenario, this alternative mechanism assumes that the magnetism has a band character and that said band forms from heavy quasiparticles composed of f electrons. This band is expected to be responsible for all three phenomena although its nature and the nature of those heavy quasiparticles still remains unclear. Here we report spectroscopic evidence for the formation in UGe2 of subnanometer-sized spin polarons whose dynamics we follow into the paramagnetic and ferromagnetic phases. These spin polarons behave as heavy carriers and thus may serve as heavy quasiparticles made of 5f electrons; once coherence is established, they form a narrow spin-polaron band which thus provides a natural reconciliation of itinerant ferromagnetism with spin-triplet superconductivity and heavy-fermion behavior.

cond-mat.str-el↗

arXiv2013

Tracing cross-free polylines oriented by a N-symmetry direction field on triangulated surfaces

We propose an algorithm for tracing polylines on a triangle mesh such that: they are aligned with a N-symmetry direction field, and two such polylines cannot cross or merge. This property is fundamental for mesh segmentation and is very difficult to enforce with numerical integration of vector fields. We propose an alternative solution based on "stream-mesh", a new combinatorial data structure that defines, for each point of a triangle edge, where the corresponding polyline leaves the triangle. It makes it possible to trace polylines by iteratively crossing triangles. Vector field singularities and polyline/vertex crossing are characterized and consistently handled. The polylines inherits the cross-free property of the stream-mesh, except inside triangles where avoiding local overlaps would require higher order polycurves.

cs.CG↗

arXiv2012

Visualizing 2D Flows with Animated Arrow Plots

Flow fields are often represented by a set of static arrows to illustrate scientific vulgarization, documentary film, meteorology, etc. This simple schematic representation lets an observer intuitively interpret the main properties of a flow: its orientation and velocity magnitude. We propose to generate dynamic versions of such representations for 2D unsteady flow fields. Our algorithm smoothly animates arrows along the flow while controlling their density in the domain over time. Several strategies have been combined to lower the unavoidable popping artifacts arising when arrows appear and disappear and to achieve visually pleasing animations. Disturbing arrow rotations in low velocity regions are also handled by continuously morphing arrow glyphs to semi-transparent discs. To substantiate our method, we provide results for synthetic and real velocity field datasets.

cs.GR↗