Search results for "Polygon"

showing 10 items of 282 documents

On Daugavet indices of thickness

2020

Inspired by R. Whitley's thickness index the last named author recently introduced the Daugavet index of thickness of Banach spaces. We continue the investigation of the behavior of this index and also consider two new versions of the Daugavet index of thickness, which helps us solve an open problem which connect the Daugavet indices with the Daugavet equation. Moreover, we will improve the formerly known estimates of the behavior of Daugavet index on direct sums of Banach spaces by establishing sharp bounds. As a consequence of our results we prove that, for every $0<\delta<2$, there exists a Banach space where the infimum of the diameter of convex combinations of slices of the unit ball i…

Unit spherePure mathematicsMathematics::Functional AnalysisIndex (economics)Existential quantificationOpen problem010102 general mathematicsRegular polygonBanach space01 natural sciencesInfimum and supremumFunctional Analysis (math.FA)Negative - answerMathematics - Functional Analysis0103 physical sciencesFOS: Mathematics46B20 46B22010307 mathematical physics0101 mathematicsAnalysisMathematics
researchProduct

Diameter 2 properties and convexity

2015

We present an equivalent midpoint locally uniformly rotund (MLUR) renorming $X$ of $C[0,1]$ on which every weakly compact projection $P$ satisfies the equation $\|I-P\| = 1+\|P\|$ ($I$ is the identity operator on $X$). As a consequence we obtain an MLUR space $X$ with the properties D2P, that every non-empty relatively weakly open subset of its unit ball $B_X$ has diameter 2, and the LD2P+, that for every slice of $B_X$ and every norm 1 element $x$ inside the slice there is another element $y$ inside the slice of distance as close to 2 from $x$ as desired. An example of an MLUR space with the D2P, the LD2P+, and with convex combinations of slices of arbitrary small diameter is also given.

Unit sphereSmall diameter46B04 46B20General Mathematics010102 general mathematicsRegular polygon01 natural sciencesMidpointConvexityFunctional Analysis (math.FA)Mathematics - Functional Analysis010101 applied mathematicsCombinatoricsNorm (mathematics)FOS: Mathematics0101 mathematicsMathematicsStudia Mathematica
researchProduct

Saliency Features for 3D CAD-Data in the Context of Sampling-Based Motion Planning

2021

In this paper, we consider disassembly scenarios for real-world 3D CAD-data, where each component is defined by a triangle mesh. For a fast construction of collision-free disassembly paths, common approaches use sampling-based rigid body motion planning which is well studied in the literature. One fact that has so far received little attention is that in industrial disassembly scenarios components are often attached to each other with flexible fastening elements like clips. In the planning process, the fastening elements show the following characteristics: 1) They can cause complex non-linear disassembly paths. 2) They are often deformable. 3) They are usually modeled in a relaxed state and…

Vertex (computer graphics)Computer sciencebusiness.industryFeature extractionContext (language use)Rigid bodyFeature (computer vision)Triangle meshComputer visionPolygon meshMotion planningArtificial intelligencebusinessComputingMethodologies_COMPUTERGRAPHICS2021 IEEE International Conference on Robotics and Automation (ICRA)
researchProduct

Modelling Polycrystalline Materials: An Overview of Three-Dimensional Grain-Scale Mechanical Models

2014

International audience; A survey of recent contributions on three-dimensional grain-scale mechanical modelling of polycrystalline materials is given in this work. The analysis of material micro-structures requires the generation of reliable micro-morphologies and affordable computational meshes as well as the description of the mechanical behavior of the elementary constituents and their interactions. The polycrystalline microstructure is characterized by the topology, morphology and crystallographic orientations of the individual grains and by the grain interfaces and microstructural defects, within the bulk grains and at the inter-granular interfaces. Their analysis has been until recentl…

Work (thermodynamics)Materials scienceMechanical engineeringNanotechnologyPolycrystalline microstructure02 engineering and technology01 natural sciencesThree-dimensional modellingMesoscale modelling[PHYS.MECA.MEMA]Physics [physics]/Mechanics [physics]/Mechanics of materials [physics.class-ph]Polycrystalline material0103 physical sciencesPolygon meshPolycrystalline MaterialsSettore ING-IND/04 - Costruzioni E Strutture AerospazialiTopology (chemistry)010302 applied physicsMechanical modelsScale (chemistry)[PHYS.MECA.MSMECA]Physics [physics]/Mechanics [physics]/Materials and structures in mechanics [physics.class-ph]021001 nanoscience & nanotechnologyComputer Science ApplicationsModeling and Simulation[PHYS.COND.CM-MS]Physics [physics]/Condensed Matter [cond-mat]/Materials Science [cond-mat.mtrl-sci]Crystallite0210 nano-technology
researchProduct

THE HOMOLOGY OF DIGRAPHS AS A GENERALIZATION OF HOCHSCHILD HOMOLOGY

2010

J. Przytycki has established a connection between the Hochschild homology of an algebra $A$ and the chromatic graph homology of a polygon graph with coefficients in $A$. In general the chromatic graph homology is not defined in the case where the coefficient ring is a non-commutative algebra. In this paper we define a new homology theory for directed graphs which takes coefficients in an arbitrary $A-A$ bimodule, for $A$ possibly non-commutative, which on polygons agrees with Hochschild homology through a range of dimensions.

[ MATH.MATH-GT ] Mathematics [math]/Geometric Topology [math.GT]57M15 16E40 05C20Homology (mathematics)[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]Mathematics::Algebraic Topology01 natural sciencesCombinatoricsMathematics - Geometric TopologyMathematics::K-Theory and Homology[MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO][ MATH.MATH-KT ] Mathematics [math]/K-Theory and Homology [math.KT]0103 physical sciencesFOS: MathematicsMathematics - CombinatoricsChromatic scale0101 mathematicsMathematics::Symplectic GeometryMathematicsAlgebra and Number TheoryHochschild homologyApplied Mathematics010102 general mathematicsGeometric Topology (math.GT)K-Theory and Homology (math.KT)Directed graphMathematics::Geometric TopologyGraphMathematics - K-Theory and HomologyPolygon[MATH.MATH-KT]Mathematics [math]/K-Theory and Homology [math.KT]BimoduleCombinatorics (math.CO)010307 mathematical physicsJournal of Algebra and Its Applications
researchProduct

A predictive approach for a real-time remote visualization of large meshes

2012

Déjà sur HAL; Remote access to large meshes is the subject of studies since several years. We propose in this paper a contribution to the problem of remote mesh viewing. We work on triangular meshes. After a study of existing methods of remote viewing, we propose a visualization approach based on a client-server architecture, in which almost all operations are performed on the server. Our approach includes three main steps: a first step of partitioning the original mesh, generating several fragments of the original mesh that can be supported by the supposed smaller Transfer Control Protocol (TCP) window size of the network, a second step called pre-simplification of the mesh partitioned, ge…

[ MATH.MATH-GT ] Mathematics [math]/Geometric Topology [math.GT]geometrytopologyComputer scienceSynthèse d'image et réalité virtuelle [Informatique]Distributed computingSewingContext (language use)02 engineering and technologySolid modeling[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]SimplificationvisualisationData visualizationtopology.[MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT]Serverpartitioning0202 electrical engineering electronic engineering information engineeringPolygon meshVisualization[MATH.MATH-GT] Mathematics [math]/Geometric Topology [math.GT]Meshbusiness.industryProcess (computing)simplification020207 software engineering[ INFO.INFO-GR ] Computer Science [cs]/Graphics [cs.GR][INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]VisualizationIEEEmesh[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]Mesh generation[ INFO.INFO-CG ] Computer Science [cs]/Computational Geometry [cs.CG]020201 artificial intelligence & image processingbusinesssewingPartitioning
researchProduct

Convergence rate of a relaxed inertial proximal algorithm for convex minimization

2018

International audience; In a Hilbert space setting, the authors recently introduced a general class of relaxed inertial proximal algorithms that aim to solve monotone inclusions. In this paper, we specialize this study in the case of non-smooth convex minimization problems. We obtain convergence rates for values which have similarities with the results based on the Nesterov accelerated gradient method. The joint adjustment of inertia, relaxation and proximal terms plays a central role. In doing so, we highlight inertial proximal algorithms that converge for general monotone inclusions, and which, in the case of convex minimization, give fast convergence rates of values in the worst case.

[ MATH.MATH-OC ] Mathematics [math]/Optimization and Control [math.OC]Class (set theory)Control and OptimizationInertial frame of referenceLyapunov analysis0211 other engineering and technologies02 engineering and technologyManagement Science and Operations Research01 natural sciencessymbols.namesakenonsmooth convex minimizationrelaxationweak-convergence0101 mathematics[MATH]Mathematics [math]point algorithmMathematics021103 operations researchWeak convergence[QFIN]Quantitative Finance [q-fin]Applied MathematicsHilbert space[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]dynamicsmaximally monotone operatorsInertial proximal method010101 applied mathematicsMonotone polygonRate of convergenceConvex optimizationmaximal monotone-operatorssymbolsRelaxation (approximation)[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]subdifferential of convex functionsAlgorithm
researchProduct

Reliable numerical solution of a class of nonlinear elliptic problems generated by the Poisson-Boltzmann equation

2020

We consider a class of nonlinear elliptic problems associated with models in biophysics, which are described by the Poisson-Boltzmann equation (PBE). We prove mathematical correctness of the problem, study a suitable class of approximations, and deduce guaranteed and fully computable bounds of approximation errors. The latter goal is achieved by means of the approach suggested in [S. Repin, A posteriori error estimation for variational problems with uniformly convex functionals. Math. Comp., 69:481-500, 2000] for convex variational problems. Moreover, we establish the error identity, which defines the error measure natural for the considered class of problems and show that it yields computa…

a priori error estimatesClass (set theory)Correctness010103 numerical & computational mathematics01 natural sciencesMeasure (mathematics)guaranteed and efficient a posteriori error boundsFOS: MathematicsApplied mathematicsPolygon meshMathematics - Numerical Analysis0101 mathematicserror indicators and adaptive mesh refinementMathematicsNumerical AnalysisApplied MathematicsRegular polygonNumerical Analysis (math.NA)convergence of finite element approximationsLipschitz continuity010101 applied mathematicsComputational MathematicsNonlinear systemexistence and uniqueness of solutionssemilinear partial differential equations65J15 49M29 65N15 65N30 65N50 35J20MathematikA priori and a posterioriPoisson-Boltzmann equationdifferentiaaliyhtälöt
researchProduct

Importance de la variabilité fonctionnelle intraspécifique des adventices en réponse aux pratiques culturales et aux conditions climatiques

2016

EAGESTADCT1; Importance de la variabilité fonctionnelle intraspécifique des adventices en réponse aux pratiques culturales et aux conditions climatiques. Ecologie des Communautés Végétales (ECOVEG 12)

agroecologySonchus asper[SDV] Life Sciences [q-bio]Polygonum persicaria[ SDV ] Life Sciences [q-bio]écologie fonctionnelle[SDV]Life Sciences [q-bio]weed-crop competitioncrop sequenceadventicesfunctional diversityChenopodium album
researchProduct

Skinning Measures with Potential on CAT(–1) Spaces

2019

In this chapter, we introduce skinning measures as weighted pushforwards of the Patterson{Sullivan densities associated with a potential to the unit normal bundles of convex subsets of a CAT(–1) space.

body regionsCombinatoricsSkinningRegular polygonSpace (mathematics)Unit (ring theory)Mathematics
researchProduct