A Simple Grid‐Maps Pipeline: Restructured, Accelerated and Upgraded
Computer Graphics Forum, EarlyView.Abstract Grid maps – spatially arranged small multiples – are a powerful tool to show complex geospatial data. Meulemans et al. (2020) introduced a pipeline for computing high‐quality grid maps that are shaped roughly according to their containing geographic outlines.
W. Meulemans
wiley +1 more source
Development of hamming and hausdorff distance metrics for cubic intuitionistic fuzzy hypersoft set in cement storage quality control: Development and evaluation. [PDF]
PLoS One, 2023 Saeed M, Saeed MH, Khalid M, Mekawy I.
europepmc +1 more source
Medial Axis Aware Learning of Signed Distance Functions
Computer Graphics Forum, EarlyView.Abstract We propose a novel variational method to compute a highly accurate global signed distance function (SDF) to a given point cloud. To this end, the jump set of the gradient of the SDF, which coincides with the medial axis of the surface, is explicitly taken into account through a higher‐order variational formulation that enforces linear growth ...
Samuel Weidemaier +2 more
wiley +1 more source
On non-separable components of hyperspaces with the Hausdorff metric [PDF]
Математичні Студії, 2011 Let $(X,d)$ be a connected non compact metric space. Suppose the metric$d$ convex and such that every closed bounded subset of $X$ is compact. Let $F(X)$ bethe space of nonvoid closed subsets of $X$ with the Hausdorff distance associated to $d$.We prove ...
R. Cauty
doaj
Progressive Convex Hull Simplification
Computer Graphics Forum, EarlyView.Abstract Convex hulls are useful as tight bounding proxies for a variety of tasks including collision detection, ray intersection, and distance computation. Unfortunately, the complexity of polyhedral convex hulls grows linearly with their input. We consider the problem of conservatively simplifying a convex hull to a specified number of half‐spaces ...
Alec Jacobson
wiley +1 more source
Remote Sensing, 2017 Buried archeological features show up as crop marks that are mostly visible using high-resolution image data. Such data are costly and restricted to small regions and time domains.
Yuqing Pan +4 more
doaj +1 more source
IH-TCGAN: Time-Series Conditional Generative Adversarial Network with Improved Hausdorff Distance for Synthesizing Intention Recognition Data. [PDF]
Entropy (Basel), 2023 Wang S, Wang G, Fu Q, Song Y, Liu J.
europepmc +1 more source
On the relationship between the Hausdorff distance and matrix distances of ellipsoids
Linear Algebra and its Applications, 1983 AbstractThe space of ellipsoids may be metrized by the Hausdorff distance or by the sum of the distance between their centers and a distance between matrices. Various inequalities between metrics are established. It follows that the square root of positive semidefinite symmetric matrices satisfies a Lipschitz condition, with a constant which depends ...
Goffin, Jean-Louis, Hoffman, Alan J.
openaire +2 more sources
A practical algorithm for weighted k‐hulls
Computer Graphics Forum, EarlyView.Abstract The convex hull is a central concept in computational geometry, geometry processing, and generally for summarizing sampled data. Its descriptive power suffers significantly in the presence of noise. The k‐hull, also known as the k‐depth contour in statistics, is the intersection of all half‐spaces that contain all but k data points, i.e. it is
N. Look, H. Meyer, M. Alexa
wiley +1 more source
Correction: On the usage of average Hausdorff distance for segmentation performance assessment: hidden error when used for ranking. [PDF]
Eur Radiol Exp, 2022 Aydin OU +7 more
europepmc +1 more source