ﻻ يوجد ملخص باللغة العربية
We propose a variant of Cauchys Lemma, proving that when a convex chain on one sphere is redrawn (with the same lengths and angles) on a larger sphere, the distance between its endpoints increases. The main focus of this work is a comparison of three alternate proofs, to show the links between Toponogovs Comparison Theorem, Legendres Theorem and Cauchys Arm Lemma.
Given a convex polyhedron $P$ of $n$ vertices inside a sphere $Q$, we give an $O(n^3)$-time algorithm that cuts $P$ out of $Q$ by using guillotine cuts and has cutting cost $O((log n)^2)$ times the optimal.
We introduce a model for random geodesic drawings of the complete bipartite graph $K_{n,n}$ on the unit sphere $mathbb{S}^2$ in $mathbb{R}^3$, where we select the vertices in each bipartite class of $K_{n,n}$ with respect to two non-degenerate probab
Motivated by map labeling, Funke, Krumpe, and Storandt [IWOCA 2016] introduced the following problem: we are given a sequence of $n$ disks in the plane. Initially, all disks have radius $0$, and they grow at constant, but possibly different, speeds.
We observe that Whiteheads lemma is an immediate consequence of Stallings folds.
Asaoka & Irie recently proved a $C^{infty}$ closing lemma of Hamiltonian diffeomorphisms of closed surfaces. We reformulated their techniques into a more general perturbation lemma for area-preserving diffeomorphism and proved a $C^{infty}$ closing l