Results 11 to 20 of about 2,125,495 (197)

On the valuations of the near polygon ℍn [PDF]

open access: yes, 2018
We characterize the valuations of the near polygon that are induced by classical valuations of the dual polar space DW (2n - 1, 2) into which it is isometrically embeddable. An application to near 2n-gons that contain as a full subgeometry is given.
De Bruyn, Bart, Bart De Bruyn
openaire   +3 more sources

fmidev/sasse-polygon-process: NHESS publication

open access: yes, 2021
SASSE II (ERA5) polygon processes including clustering, tracking and feature ...
Roope Tervo
core   +1 more source

ArcGis-Zr-polygon-model. Thin-section detrital zircon geochronology mitigates bias in provenance investigations

open access: yes, 2021
ArcGis-Zr-polygon-model: This script was automatically generated via ArcGis by exporting the 'ArcGis-Zr-polygon-model'
Christopher L. Kirkland (2842424)   +3 more
core   +1 more source

Machine-assisted discovery of integrable symplectic mappings

open access: yesPhysical Review Research, 2023
We present a new automated method for finding integrable symplectic maps of the plane. These dynamical systems possess a hidden symmetry associated with an existence of conserved quantities, i.e., integrals of motion.
T. Zolkin, Y. Kharkov, S. Nagaitsev
doaj   +1 more source

Searching for the closest-pair in a query translate

open access: yesJournal of Computational Geometry, 2020
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 $\varGamma$
Jie Xue   +3 more
doaj   +1 more source

Near polygons with a nice chain of sub-near polygons

open access: yesJournal of Combinatorial Theory, Series A, 2004
A near polygon is a partial linear space \({\mathcal S}=({\mathcal P},{\mathcal L})\) with the property that for every point \(p\in {\mathcal P}\) and for every line \(L\in {\mathcal L}\) there exists a unique point on \(L\) nearest to \(p\). Here distances \(d(\cdot,\cdot)\) are measured in the collinearity graph \(\Gamma\). If \(n=\text{diam}(\Gamma)\
Bart De Bruyn, Pieter Vandecasteele
openaire   +2 more sources

Brief communication: Rapid machine-learning-based extraction and measurement of ice wedge polygons in high-resolution digital elevation models [PDF]

open access: yesThe Cryosphere, 2019
We present a workflow for the rapid delineation and microtopographic characterization of ice wedge polygons within high-resolution digital elevation models.
C. J. Abolt   +4 more
doaj   +1 more source

Pulse Tripling Circuit and Twelve Pulse Rectifier Combination for Sinusoidal Input Current

open access: yesIEEE Access, 2021
In this paper, a novel pulse tripling circuit (PTC) is suggested, to upgrade a polygon autotransformer 12-pulse rectifier (12-PR) to a 36-pulse rectifier (36-PR) with a low power rating.
Rohollah Abdollahi   +3 more
doaj   +1 more source

A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment [PDF]

open access: yesDiscrete & Computational Geometry, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dan Halperin, Micha Sharir
openaire   +1 more source

Polygon-generation process.

open access: yes, 2020
(a) Random point distribution, (b) polygon initialization, (c) result of one iteration, (d) result of two iterations, (e) result of three iterations, and (f) final polygon.
Hongyun Zhang (419746)   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy