English
Related papers

Related papers: Rolling of Coxeter polyhedra along mirrors

200 papers

We present a constructive approach for approximating the conformal map (uniformization) of a polyhedral surface to a canonical domain in the plane. The main tool is a characterization of convex spaces of quasiconformal simplicial maps and…

Computational Geometry · Computer Science 2013-01-29 Yaron Lipman

We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family…

Metric Geometry · Mathematics 2014-03-17 Balázs Keszegh , Dömötör Pálvölgyi

In this paper, we will answer one of the questions proposed by Bodur, Del~Pia, Dey, Molinaro and Pokutta in 2017. Specifically, we show that the k-aggregation closure of a covering set is a polyhedron. The proof technique is based on an…

Optimization and Control · Mathematics 2022-08-30 Haoran Zhu

We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. We in particular discuss decomposition methods, which reduce the problem to a number of…

Metric Geometry · Mathematics 2011-10-20 David Bremner , Mathieu Dutour Sikiric , Achill Schuermann

We show that for every convex polyhedral sphere $P$ in $S^3$, there exist two canonical, non-edge-to-edge tilings of $S^{2}$ whose tiles are given by all the faces of $P$ and the dual convex polyhedral sphere $P^*$ to $P$. Under the…

Geometric Topology · Mathematics 2022-04-12 Kentaro Ito

In the present paper, loxodromes, which cut all meridians and parallels of twisted surfaces (that can be considered as a generalization of rotational surfaces) at a constant angle, have been studied in Euclidean 3-space and some examples…

Differential Geometry · Mathematics 2021-11-22 Mustafa Altin

It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for…

Computational Geometry · Computer Science 2009-09-29 Marc Glisse , Sylvain Lazard

At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact two…

Metric Geometry · Mathematics 2018-11-06 Karoly Bezdek , Muhammad A. Khan

We investigate the question of whether any $d$-colorable simplicial $d$-polytope can be octahedralized, i.e., it can be subdivided to a $d$-dimensional geometric cross-polytopal complex. We give a positive answer in dimension $3$, with the…

Combinatorics · Mathematics 2019-12-19 Giulia Codenotti , Lorenzo Venturello

We consider compact hyperbolic Coxeter polytopes whose Coxeter diagram contains a unique dotted edge. We prove that such a polytope in d-dimensional hyperbolic space has at most d+3 facets. In view of results of Lann\'er, Kaplinskaja,…

Metric Geometry · Mathematics 2022-09-13 Anna Felikson , Pavel Tumarkin

In view of solving problems of geometric realizability of polyhedra with given geometric constraints, we describe the space of geometric realizations of a simply-connected triangulated euclidean polyhedron in $\mathbb{R}^3$ up to similarity…

Metric Geometry · Mathematics 2017-03-10 Maria Hempel

We show that every bounded hyperconvex Reinhardt domain can be approximated by special polynomial polyhedra defined by homogeneous polynomial mappings. This is achieved by means of approximation of the pluricomplex Green function of the…

Complex Variables · Mathematics 2011-09-30 Alexander Rashkovskii , Vyacheslav Zakharyuta

An equiangular hyperbolic Coxeter polyhedron is a hyperbolic polyhedron where all dihedral angles are equal to \pi/n for some fixed integer n at least 2. It is a consequence of Andreev's theorem that either n=3 and the polyhedron has all…

Geometric Topology · Mathematics 2014-10-01 Christopher K. Atkinson

Answering a question of Conway and Guy in a 1968 paper, L\'angi in 2021 proved the existence of a monostable polyhedron with $n$-fold rotational symmetry for any $n \geq 3$, and arbitrarily close to a Euclidean ball. In this paper we…

Metric Geometry · Mathematics 2022-01-03 G. Domokos , Z. Lángi , P. Várkonyi

We provide sufficient conditions assuring that a suitably decorated 2-polyhedron can be thickened to a compact 4-dimensional Stein domain. We also study a class of flat polyhedra in 4-manifolds and find conditions assuring that they admit…

Complex Variables · Mathematics 2007-05-23 Francesco Costantino

We study the duality of moduli of k- and (n-k)-dimensional slices of euclidean n-cubes, and establish the optimal upper bound 1.

Metric Geometry · Mathematics 2020-07-08 Atte Lohvansuu

Most genuine multi-sided surface representations depend on a 2D domain that enables a mapping between local parameters and global coordinates. The shape of this domain ranges from regular polygons to curved configurations, but the simple…

Computational Geometry · Computer Science 2023-05-15 Péter Salvi

Motivated by applications in geomorphology, the aim of this paper is to extend Morse-Smale theory from smooth functions to the radial distance function (measured from an internal point), defining a convex polyhedron in 3-dimensional…

Computational Geometry · Computer Science 2023-06-16 Balázs Ludmány , Zsolt Lángi , Gábor Domokos

It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…

Metric Geometry · Mathematics 2019-02-08 Milica Stojanović

We study the abstract regular polyhedra with automorphism groups that act faithfully on their vertices, and show that each non-flat abstract regular polyhedron covers a "vertex-faithful" polyhedron with the same number of vertices. We then…

Combinatorics · Mathematics 2020-06-01 Gabe Cunningham , Mark Mixer
‹ Prev 1 4 5 6 7 8 10 Next ›