Search results for "Polygon"
showing 10 items of 282 documents
The Bourgain property and convex hulls
2007
Let (Ω, Σ, μ) be a complete probability space and let X be a Banach space. We consider the following problem: Given a function f: Ω X for which there is a norming set B ⊂ BX * such that Zf,B = {x * ○ f: x * ∈ B } is uniformly integrable and has the Bourgain property, does it follow that f is Birkhoff integrable? It turns out that this question is equivalent to the following one: Given a pointwise bounded family ℋ ⊂ ℝΩ with the Bourgain property, does its convex hull co(ℋ) have the Bourgain property? With the help of an example of D. H. Fremlin, we make clear that both questions have negative answer in general. We prove that a function f: Ω X is scalarly measurable provided that there is a n…
Historical Notes on Star Geometry in Mathematics, Art and Nature
2018
Gamma: “I can. Look at this Counterexample 3: a star-polyhedron I shall call it urchin. This consists of 12 star-pentagons. It has 12 vertices, 30 edges, and 12 pentagonal faces-you may check it if you like by counting. Thus the Descartes-Euler thesis is not true at all, since for this polyhedron \(V - E + F = - 6\)”. Delta: “Why do you think that your ‘urchin’ is a polyhedron?” Gamma: “Do you not see? This is a polyhedron, whose faces are the twelve star-pentagons”. Delta: “But then you do not even know what a polygon is! A star-pentagon is certainly not a polygon!”
Equidistribution of Common Perpendicular Arcs
2019
In this chapter, we prove the equidistribution of the initial and terminal vectors of common perpendiculars of convex subsets, at the universal covering space level, for Riemannian manifolds and for metric and simplicial trees.
Generic attribute deviation metric for assessing mesh simplification algorithm quality
2002
International audience; This paper describes an efficient method to compare two triangular meshes. Meshes considered here contain geometric features as well as other surface attributes such as material colors, texture, temperature, radiation, etc. Two deviation measurements are presented to assess the differences between two meshes. The first measurement, called geometric deviation, returns geometric differences. The second measurement , called attribute deviation, returns attribute differences regardless of the attribute type. In this paper we present an application of this method to the Mesh Simplification Algorithm (MSA) quality assessment according to the appearance attributes. This ass…
Efficiently using connectivity information between triangles in a mesh for real-time rendering
2004
Triangle meshes are the most popular standard model used to represent polygonal surfaces. Drawing these meshes as a set of independent triangles involves sending a vast amount of information to the graphics system. Taking advantage of the connectivity information between the triangles in a mesh dramatically diminishes the amount of information the graphics system must handle. Multiresolution Triangle Strips (MTS) represent a triangle mesh as a collection of multiresolution triangles strips. These strips are the basis of both the storage and the rendering stage. The coherence between the extraction of two levels of detail is used in the model in order to decrease the visualisation time.
Locally constrained synthetic LoDs generation for natural terrain meshes
2004
Terrain representation is a basic topic in the field of interactive graphics. The amount of data required for a good quality of the terrain offers an important challenge to developers of such systems. For users of these applications, the accuracy of geographical data is generally less important than its natural visual appearance. This makes it possible to maintain a limited geographical database for the system and to extend it generating synthetic data. The evaluation of the intrinsic properties of the terrain (i.e. fractal dimension, roughness, etc.) may be used as the basis for generating extra data accomplishing the same patterns discovered in the actual information. However, it is also …
An abstract inf-sup problem inspired by limit analysis in perfect plasticity and related applications
2021
This paper is concerned with an abstract inf-sup problem generated by a bilinear Lagrangian and convex constraints. We study the conditions that guarantee no gap between the inf-sup and related sup-inf problems. The key assumption introduced in the paper generalizes the well-known Babuška–Brezzi condition. It is based on an inf-sup condition defined for convex cones in function spaces. We also apply a regularization method convenient for solving the inf-sup problem and derive a computable majorant of the critical (inf-sup) value, which can be used in a posteriori error analysis of numerical results. Results obtained for the abstract problem are applied to continuum mechanics. In particular…
Efficient Implementation of Multiresolution Triangle Strips
2002
Triangle meshes are currently the most popular standard modelto represent polygonal surfaces. Drawing these meshes as a set of independent triangles involves sending a vast amount of information to the graphic engine. It has been shown that using drawing primitives, such as triangle fans or strips, dramatically reduces the amount of information. Multiresolution Triangle Strips (MTS) uses the connectivity information to represent a mesh as a set of multiresolution triangles strips. These strips are the basis of both the storage and rendering stages. They allow the efficient management of a wide range of levels of detail. In this paper, we have taken advantage of the coherence property betwee…
From the nearest neighbour rule to decision trees
1998
This paper proposes an algorithm to design a tree-like classifier whose result is equivalent to that achieved by the classical Nearest Neighbour rule. The procedure consists of a particular decomposition of a d-dimensional feature space into a set of convex regions with prototypes from just one class. Some experimental results over synthetic and real databases are provided in order to illustrate the applicability of the method.
A hybrid virtual–boundary element formulation for heterogeneous materials
2021
Abstract In this work, a hybrid formulation based on the conjoined use of the recently developed Virtual Element Method (VEM) and the Boundary Element Method (BEM) is proposed for the effective computational analysis of multi-region domains, representative of heterogeneous materials. VEM has been recently developed as a generalisation of the Finite Element Method (FEM) and it allows the straightforward employment of elements of general polygonal shape, maintaining a high level of accuracy. For its inherent features, it allows the use of meshes of general topology, including non-convex elements. On the other hand, BEM is an effective technique for the numerical solution of sets of boundary i…