Home Knowledge Base Minkowski

Minkowski

No mentions found

This entity hasn't been tracked yet, or Iris is still building its knowledge base.

Related Articles from SNS

Non-Gaussian Expansion of Minkowski Tensors in Redshift Space

Announce Type: replace-cross Abstract: This paper focuses on extending the use of Minkowski Tensors to analyze anisotropic signals in cosmological data, focusing on those introduced by redshift space distortion. We derive the ensemble average of the two translation-invariant, rank-2 Minkowski Tensors ($W_1^{0,2}$ and $W_2^{0,2}$) for a matter density field that is perturbatively non-Gaussian in redshift space. This is achieved through the Edgeworth expansion of the joint probability density...

arXiv Physics 1d ago

On the multi-frequency electromagnetic emission from a rotating charged dielectric disk made of isotropic media

arXiv:2606.03105v1 Announce Type: new Abstract: The electromagnetic behavior of a uniformly moving medium has been traditionally described by the Minkowski's theory, based on which the electromagnetic (EM) emission from a rotating isotropic medium should be linear, which means that the frequency of the EM emission should be the same as that of the excitation source. However, we experimentally observed that the near-field EM emission from a rotating charged dielectric disk shows discrete...

arXiv Physics 7d ago

3d Summation-by-Parts scheme for Linear Wave Equations on Hyperboloidal Slices

arXiv:2606.02051v1 Announce Type: cross Abstract: We derive a fully 3-dimensional Summation-By-Parts scheme for a class of linear wave equations on hyperboloidal slices that meet future null infinity on a Minkowski background. The scheme is derived in spherical polar coordinates, with a major strength being that it is provably stable and allows having grid points at the origin and on the $z$-axis, despite coordinate singularities, and at infinity, by introducing compactification followed by...

arXiv CS 8d ago

OffsetCrust: Variable-Radius Offset Approximation with Power Diagrams

Announce Type: replace Abstract: Offset surfaces, defined as the Minkowski sum of a base surface and a rolling ball, play a crucial role in geometry processing, with applications ranging from coverage motion planning to brush modeling. While considerable progress has been made in computing constant-radius offset surfaces, computing variable-radius offset surfaces remains a challenging problem. In this paper, we present OffsetCrust, a novel framework that efficiently addresses the...

arXiv CS 2d ago

Mathematical Morphology in Machine Learning

arXiv:2605.30700v1 Announce Type: new Abstract: This work introduces mathematical morphology-an established visual computing theory-into machine learning to exploit shape and density aspects often overlooked by standard techniques. We propose a fast clustering algorithm based on morphological reconstruction that accurately preserves cluster shapes and density. This scheme offers unique features: an intrinsic sense of maximal clusters, cost-free noise removal, and diverse growth patterns...

arXiv CS 9d ago

Tunable Real-Time Safety Filters via Set-Based Control Barrier Functions

arXiv:2507.07805v3 Announce Type: replace Abstract: Safety filters for industrial constrained systems are required to combine certified constraint satisfaction, predictable online computation, and a transparent tuning interface. Existing set-based filters are based on a well-established control invariant set design that scales favorably with state and input constraints, but typically intervene only at the set boundary. Control barrier function (CBF)-based filters, by contrast, provide...

arXiv CS 1d ago

Online K-d tree for approximate neighborhood search in data streams

arXiv:2606.02752v1 Announce Type: new Abstract: The k-Nearest Neighbors (kNN) algorithm has long been widely used in Machine Learning (ML) applications. However, the main concern when using it is the computational cost required for neighborhood search, which can make it unfeasible for large-scale applications. Optimization algorithms, such as the K-d tree, become an option in such scenarios.

arXiv CS 7d ago