Results 71 to 80 of about 5,623,825 (245)
Constrained Variational-Hemivariational Inequalities on Nonconvex Star-Shaped Sets
Mathematics, 2020 In this paper, we study a class of constrained variational-hemivariational inequality problems with nonconvex sets which are star-shaped with respect to a certain ball in a reflexive Banach space.
Stanisław Migórski, Long Fengzhen
doaj +1 more source
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT This paper proposes a boundary control method for nonlinear distributed parameter systems (DPSs) with limited boundary measurements (BMs), as typically encountered in networked cyber‐physical processes with spatially distributed dynamics such as thermal and biomedical diffusion systems.
Yanlin Li +5 more
wiley +1 more source
Infinitely Many Solutions for a Non-homogeneous Differential Inclusion with Lack of Compactness
Advanced Nonlinear Studies, 2019 In this paper, we consider the following class of differential inclusion problems in ℝN{\mathbb{R}^{N}} involving the p(x){p(x)}-Laplacian:
Ge Bin, Rădulescu Vicenţiu D.
doaj +1 more source
SDFs from Unoriented Point Clouds using Neural Variational Heat Distances
Computer Graphics Forum, EarlyView.We propose a novel variational approach for computing neural Signed Distance Fields (SDF) from unoriented point clouds. We first compute a small time step of heat flow (middle) and then use its gradient directions to solve for a neural SDF (right). Abstract We propose a novel variational approach for computing neural Signed Distance Fields (SDF) from ...
Samuel Weidemaier +5 more
wiley +1 more source
Classification of Lipschitz simple function germs [PDF]
, 2020 It was shown by Henry and Parusiński in 2003 that the bi-Lipschitz right equivalence of function germs admits moduli. In this article, we introduce the notion of Lipschitz simple function germ and present the complete classification in the complex case ...
Ruas, M., Nguyen, N., Trivedi, S.
core +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
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
Existence and comparison results for variational-hemivariational inequalities
Journal of Inequalities and Applications, 2005 We consider a prototype of quasilinear elliptic variational-hemivariational inequalities involving the indicator function of some closed convex set and a locally Lipschitz functional.
Carl S
doaj
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