اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNotes on Convex Sets, Polytopes, Polyhedra, Combinatorial Topology, Voronoi Diagrams and Delaunay Triangulations
237
0
0.0
(
0
)
تأليف
Jean Gallier
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed as a tutorial and a set of notes on convex sets, polytopes, polyhedra, combinatorial topology, Voronoi Diagrams and Delaunay Triangulations. It is intended for a broad audience of mathematically inclined readers. I have included a rather thorough treatment of the equivalence of V-polytopes and H-polytopes and also of the equivalence of V-polyhedra and H-polyhedra, which is a bit harder. In particular, the Fourier-Motzkin elimination method (a version of Gaussian elimination for inequalities) is discussed in some detail. I also included some material on projective spaces, projective maps and polar duality w.r.t. a nondegenerate quadric in order to define a suitable notion of ``projective polyhedron based on cones. To the best of our knowledge, this notion of projective polyhedron is new. We also believe that some of our proofs establishing the equivalence of V-polyhedra and H-polyhedra are new.
قيم البحث
اقرأ أيضاً
We study densities of functionals over uniformly bounded triangulations of a Delaunay set of vertices, and prove that the minimum is attained for the Delaunay triangulation if this is the case for finite sets.
In this paper we study first-passge percolation models on Delaunay triangulations. We show a sufficient condition to ensure that the asymptotic value of the rescaled first-passage time, called the time constant, is strictly positive and derive some u
pper bounds for fluctuations. Our proofs are based on renormalization ideas and on the method of bounded increments.
We present a constructive proof of Alexandrovs theorem regarding the existence of a convex polytope with a given metric on the boundary. The polytope is obtained as a result of a certain deformation in the class of generalized convex polytopes with t
he given boundary. We study the space of generalized convex polytopes and discover a relation with the weighted Delaunay triangulations of polyhedral surfaces. The existence of the deformation follows from the non-degeneracy of the Hessian of the total scalar curvature of a positively curved generalized convex polytope. The latter is shown to be equal to the Hessian of the volume of the dual generalized polyhedron. We prove the non-degeneracy by generalizing the Alexandrov-Fenchel inequality. Our construction of a convex polytope from a given metric is implemented in a computer program.
We study epidemic outbreaks on random Delaunay triangulations by applying Asynchronous SIR (susceptible-infected-removed) model kinetic Monte Carlo dynamics coupled to lattices extracted from the triangulations. In order to investigate the critical b
ehavior of the model, we obtain the cluster size distribution by using Newman-Ziff algorithm, allowing to simulate random inhomogeneous lattices and measure any desired percolation observable. We numerically calculate the order parameter, defined as the wrapping cluster density, the mean cluster size, and Binder cumulant ratio defined for percolation in order to estimate the epidemic threshold. Our findings suggest that the system falls into two-dimensional dynamic percolation universality class and the quenched random disorder is irrelevant, in agreement with results for classical percolation.
For $3$-dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hyperbolic geometry. In particular, inscribability can be tested in polyno
mial time, and for every $f$-vector of $3$-polytopes, there exists an inscribable polytope with that $f$-vector. For higher-dimensional polytopes, much less is known. Of course, for any inscribable polytope, all of its lower-dimensional faces need to be inscribable, but this condition does not appear to be very strong. We observe non-trivial new obstructions to the inscribability of polytopes that arise when imposing that a certain inscribable face be inscribed. Using this obstruction, we show that the duals of the $4$-dimensional cyclic polytopes with at least $8$ vertices---all of whose faces are inscribable---are not inscribable. This result is optimal in the following sense: We prove that the duals of the cyclic $4$-polytopes with up to $7$ vertices are, in fact, inscribable. Moreover, we interpret this obstruction combinatorially as a forbidden subposet of the face lattice of a polytope, show that $d$-dimensional cyclic polytopes with at least $d+4$ vertices are not circumscribable, and that no dual of a neighborly $4$-polytope with $8$ vertices, that is, no polytope with $f$-vector $(20,40,28,8)$, is inscribable.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
