Results 111 to 120 of about 2,723,896 (281)
Lipschitz functions of continuous functions [PDF]
Pacific Journal of Mathematics, 1953 Marx, Imanuel, Piranian, George
openaire +3 more sources
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
Compactly supported detail field for high quality neural implicit surfaces
Computer Graphics Forum, EarlyView.Abstract Neural implicit surfaces are a powerful tool for encoding a surface as the zero level set of a neural function. Trained using gradient‐descent based optimizers, these methods however suffer from a low‐frequency bias that prevents them to fit fine details of the surface.
Guillaume Coiffier, Justine Basselin
wiley +1 more source
Lipschitz measures and vector-valued Hardy spaces
International Journal of Mathematics and Mathematical Sciences, 2001 We define certain spaces of Banach-valued measures called Lipschitz measures. When the Banach space is a dual space X*, these spaces can be identified with the duals of the atomic vector-valued Hardy spaces HXp(ℝn ...
Magali Folch-Gabayet +2 more
doaj +1 more source
Tangent Blow‐Ups for Processing Non‐Manifold Geometry
Computer Graphics Forum, EarlyView.Abstract Many geometry processing pipelines implicitly assume their input data is a manifold, or is sampled from one, with a unique tangent plane at every point. Geometric data, however, routinely contains sharp features like edges, corners, self‐intersections, branching junctions, and other singularities, rendering standard methods ill‐defined at ...
Alice Petrov +3 more
wiley +1 more source
Strictly Conservative Neural Distance Fields
Computer Graphics Forum, EarlyView.Abstract We propose a first method to generate neural unsigned or signed distance fields (SDFs) that are guaranteed to be conservative with respect to a given 3D shape. This means the true distance is never overestimated and the zero‐level set is a bounding volume for the shape. The method makes use of neural network architectures that ensure Lipschitz
I. Ludwig, M. Campen
wiley +1 more source
(δ,γ)-Jacobi-Dunkl Lipschitz Functions in the Space L2(R,Aα,β(x)dx)
International Journal of Analysis and Applications, 2015 Using a generalized Jacobi-Dunkl translation, we obtain an analog of Theorem 5.2 in Younis paper [7] for the Jacobi-Dunkl transform for functions satisfying the (δ,γ)-Jacobi-Dunkl Lipschitz condition in the space L2(R,Aα,β(x)dx), α ≥ β ≥−1/2, α ≠−1/2.
R. Daher, S. El Ouadih
doaj +2 more sources
A Splitting Architecture for Exact Reduced Coulomb Friction
Computer Graphics Forum, EarlyView.Abstract Existing approaches to frictional contact dynamics typically either modify the Coulomb law to improve numerical robustness or solve the exact law in a fully coupled monolithic form. However, in its reduced form, exact Coulomb friction can be written as a cone complementarity problem with an augmented velocity, which reveals a natural split ...
Hongcheng Song +3 more
wiley +1 more source
The extension of starshaped bounded Lipschitz functions
Journal of Numerical Analysis and Approximation Theory, 1980 Not available.
C. Mustăţa
doaj +2 more sources
A Non‐Parametric Framework for Correlation Functions on Product Metric Spaces
International Statistical Review, EarlyView.Summary We propose a non‐parametric framework for analysing data defined over products of metric spaces, a versatile class encountered in various fields. This framework accommodates non‐stationarity and seasonality and is applicable to both local and global domains, such as the Earth's surface, as well as domains evolving over linear time or time ...
Pier Giovanni Bissiri +3 more
wiley +1 more source