Results 31 to 40 of about 733 (147)
Open questions asked to analysis and numerics concerning the Hausdorff moment problem
CoRR, 2022 We address facts and open questions concerning the degree of ill-posedness of the composite Hausdorff moment problem aimed at the recovery of a function $x \in L^2(0,1)$ from elements of the infinite dimensional sequence space $\ell^2$ that characterize moments applied to the antiderivative of $x$.
Daniel Gerth, Bernd Hofmann 0001
openaire +2 more sources
Establishing Shape Correspondences: A Survey
Computer Graphics Forum, EarlyView.Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley +1 more source
Visnik Harkivsʹkogo Nacionalʹnogo Universitetu im. V.N. Karazina. Cepiâ Matematika, Prikladna Matematika i Mehanika, 2017 A new multiplicative decomposition of the resolvent matrix of the truncated Hausdorff matrix moment (THMM) problem in the case of an odd and even number of moments via new Dyukarev-Stieltjes matrix (DSM) parameters is attained.
Abdon E. Choque-Rivero
doaj
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
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
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
An algorithm for the Hausdorff moment problem
Numerische Mathematik, 1982 Given 0?x?1 and the moments $$\mu _n (f) = \int\limits_0^1 {t^n f(t)dt} $$ of a suitably smooth functionf, a sequence of approximations is presented which converges tof(x). An asymptotic expansion of the error is established. This shows how to construct a useful acceleration of the convergence.
openaire +1 more source
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
Advances in 4D Representation: Geometry, Motion, and Interaction
Computer Graphics Forum, EarlyView.We survey 4D representation through three key pillars — geometry, motion, and interaction — offering a selective, representation‐centric perspective to guide researchers in choosing and customizing the right 4D representation for their tasks. Abstract We present a survey on 4D generation and reconstruction, a fast‐evolving subfield of computer graphics
M. Zhao +7 more
wiley +1 more source
Hausdorff's moment problem and expansions in Legendre polynomials
Journal of Mathematical Analysis and Applications, 1982 AbstractA new proof is given for Hausdorff's condition on a set of moments which determines when the function generating these moments is in L2. The proof uses Legendre polynomials and their discrete extensions found by Tchebychef. Then an extension is given to a weighted L2 space using Jacobi polynomials and their discrete extensions.
Askey, R, Schoenberg, I.J, Sharma, A
openaire +2 more sources