Search results for "computational geometry"
showing 10 items of 139 documents
Optimal Guard Placement Problem Under L-Visibility
2006
Two points a and b in the presence of polygonal obstacles are L-visible if the length of the shortest path avoiding obstacles is no more than L. For a given convex polygon Q, Gewali et al [4]. addressed the guard placement problem on the exterior boundary that will cover the maximum area exterior to the polygon under L-visibility. They proposed a linear time algorithm for some given value of L. When the length L is greater than half of the perimeter, they declared that problem as open. Here we address that open problem and present an algorithm whose time complexity is linear in number of vertices of the polygon.
"Table 23" of "Energy dependence of event shapes and of alpha(s) at LEP-2."
1999
Distributions of Planarity at cm energies 133, 161 and 172 GeV.
"Table 24" of "Energy dependence of event shapes and of alpha(s) at LEP-2."
1999
Distribution of Planarity at cm energy 183 GeV.
"README and Table of Contents" of "Search for trilepton resonances from chargino and neutralino pair production in $\sqrt{s}$ = 13 TeV $pp$ collision…
2021
This is the HEPData space for the trilepton resonance wino search, the full resolution figures can be found here https://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/SUSY-2018-36/. The full statistical likelihoods have been provided for this analysis. They can be downloaded by clicking on the purple 'Resources' buttun above where they can then be found in the 'Common Resources' area. A detailed README for how to use the likelihoods is also included in this download. Exclusion contours: Obs. data vs SM bkg. exp. in CRs and VRs $\ell=(e, \mu, \tau)$, Obs_0 $\ell=(e, \mu, \tau)$, Obs_0_Up $\ell=(e, \mu, \tau)$, Obs_0_Down $\ell=(e, \mu, \tau)$, Exp_0 $\ell=(e, \mu, \tau)$, Exp_0_Up $\ell=(e, …
Fuzzy Fusion in Multimodal Biometric Systems
2007
Multimodal authentication systems represent an emerging trend for information security. These systems could replace conventional mono-modal biometric methods using two or more features for robust biometric authentication tasks. They employ unique combinations of measurable physical characteristics: fingerprint, facial features, iris of the eye, voice print, hand geometry, vein patterns, and so on. Since these traits are hardly imitable by other persons, the aim of these multibiometric systems is to achieve a high reliability to determine or verify person's identity. In this paper a multimodal biometric system using two different fingerprints is proposed. The matching module integrates fuzzy…
Counter-complementarity control of the weak exchange interaction in a bent {Ni(ii)3 complex with a μ-phenoxide-μ-carboxylate double bridge
2019
We have prepared and structurally characterized a novel {Ni3} bent complex bearing a double μ-phenoxide-μ-carboxylate bridge. Both terminal Ni(ii) sites are symmetry related, offering a simplified exchange interaction scheme. DC magnetic data is consistent with a weak antiferromagnetic interaction between the central and terminal Ni(ii) ions. As expected for a Ni(ii) system, local zero-field splitting is observed, which can be experimentally established. Broken symmetry quantum chemical calculations, as well as ab initio CASSCF-SA-SOC computations that support the magnetic experimental data, were also performed. From the analysis of other reported closely related Ni(ii) systems, a counter-c…
An efficient upper bound of the rotation distance of binary trees
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.
Bézier surfaces of minimal area: The Dirichlet approach
2004
The Plateau-Bezier problem consists in finding the Bezier surface with minimal area from among all Bezier surfaces with prescribed border. An approximation to the solution of the Plateau-Bezier problem is obtained by replacing the area functional with the Dirichlet functional. Some comparisons between Dirichlet extremals and Bezier surfaces obtained by the use of masks related with minimal surfaces are studied.
Local minimizers and gamma-convergence for nonlocal perimeters in Carnot groups
2020
We prove the local minimality of halfspaces in Carnot groups for a class of nonlocal functionals usually addressed as nonlocal perimeters. Moreover, in a class of Carnot groups in which the De Giorgi's rectifiability Theorem holds, we provide a lower bound for the $\Gamma$-liminf of the rescaled energy in terms of the horizontal perimeter.
Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions
2007
For any AND-OR formula of size N, there exists a bounded-error N1/2+o(1)-time quantum algorithm, based on a discrete-time quantum walk, that evaluates this formula on a black-box input. Balanced, or "approximately balanced," formulas can be evaluated in O(radicN) queries, which is optimal. It follows that the (2-o(1))th power of the quantum query complexity is a lower bound on the formula size, almost solving in the positive an open problem posed by Laplante, Lee and Szegedy.