Results 11 to 20 of about 8,755 (208)

Relative Hausdorff distance for network analysis [PDF]

open access: yesApplied Network Science, 2019
Similarity measures are used extensively in machine learning and data science algorithms. The newly proposed graph Relative Hausdorff (RH) distance is a lightweight yet nuanced similarity measure for quantifying the closeness of two graphs.
Sinan G. Aksoy   +3 more
doaj   +3 more sources

Branching Geodesics of the Gromov-Hausdorff Distance

open access: yesAnalysis and Geometry in Metric Spaces, 2022
In this paper, we first evaluate topological distributions of the sets of all doubling spaces, all uniformly disconnected spaces, and all uniformly perfect spaces in the space of all isometry classes of compact metric spaces equipped with the Gromov ...
Ishiki Yoshito
doaj   +3 more sources

Chordal Hausdorff Convergence and Quasihyperbolic Distance [PDF]

open access: yesAnalysis and Geometry in Metric Spaces, 2020
We study Hausdorff convergence (and related topics) in the chordalization of a metric space to better understand pointed Gromov-Hausdorff convergence of quasihyperbolic distances (and other conformal distances).
Herron David A.   +2 more
doaj   +3 more sources

Computational aspects of the Hausdorff distance in unbounded dimension

open access: yesJournal of Computational Geometry, 2014
We study the computational complexity of determining the Hausdorff distance oftwo polytopes given in halfspace- or vertex-presentation in arbitrary dimension.
Stefan König
doaj   +3 more sources

The Complexity of the Hausdorff Distance

open access: yesDiscrete & Computational Geometry, 2023
AbstractWe investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for the complexity class $${ \forall \exists _{<}\mathbb {R}} $$ ∀
Paul Jungeblut   +2 more
openaire   +11 more sources

GAN‐LSTM‐3D: An efficient method for lung tumour 3D reconstruction enhanced by attention‐based LSTM

open access: yesCAAI Transactions on Intelligence Technology, EarlyView., 2023
Abstract Three‐dimensional (3D) image reconstruction of tumours can visualise their structures with precision and high resolution. In this article, GAN‐LSTM‐3D method is proposed for 3D reconstruction of lung cancer tumours from 2D CT images. Our method consists of three phases: lung segmentation, tumour segmentation, and tumour 3D reconstruction. Lung
Lu Hong   +12 more
wiley   +1 more source

On the Budgeted Hausdorff Distance Problem

open access: yesComput. Geom. Topol., 2023
To appear in CCCG ...
Sariel Har-Peled, Benjamin Raichel
openaire   +2 more sources

Hausdorff vs Gromov-Hausdorff distances

open access: yes, 2023
Let $M$ be a closed Riemannian manifold and let $X\subseteq M$. If the sample $X$ is sufficiently dense relative to the curvature of $M$, then the Gromov-Hausdorff distance between $X$ and $M$ is bounded from below by half their Hausdorff distance, namely $d_{GH}(X,M) \ge \frac{1}{2} d_H(X,M)$.
Adams, Henry   +3 more
openaire   +2 more sources

On optimal polyline simplification using the Hausdorff and Fréchet distance

open access: yesJournal of Computational Geometry, 2020
We revisit the classical polygonal line simplification problem and study it using the Hausdorff distance and Fréchet distance. Interestingly, no previous authors studied line simplification under these measures in its pure form, namely: for a given ε ...
Marc van Kreveld   +2 more
doaj   +1 more source

Priority Degrees and Distance Measures of Complex Hesitant Fuzzy Sets With Application to Multi-Criteria Decision Making

open access: yesIEEE Access, 2023
The notion of a complex hesitant fuzzy set (CHFS) is one of the better tools in order to deal with complex information. Since distance plays a crucial role in order to differentiate between two things or sets, in this paper, we first develop a priority ...
Muhammad Sajjad Ali Khan   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy