English
Related papers

Related papers: Pach's animal problem within the bounding box

200 papers

In this article, we consider the problems of finding in $d+1$ dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex body into which a given set of $d$-dimensional unit-radius…

Computational Geometry · Computer Science 2025-09-30 Helmut Alt , Sergio Cabello , Otfried Cheong , Ji-won Park , Nadja Seiferth

The classical Pell equation can be extended to the cubic case considering the elements of norm one in $Z[\sqrt[3]{r}]$, which satisfy $x^3 + r y^3 + r^2 z^3 - 3 r x y z = 1$. The solution of the cubic Pell equation is harder than the…

Number Theory · Mathematics 2022-03-11 Simone Dutto , Nadir Murru

In this paper we consider the generalization of the Cheeger problem which comes by considering the ratio between the perimeter and a certain power of the volume. This generalization has been already sometimes treated, but some of the main…

Metric Geometry · Mathematics 2018-03-02 Aldo Pratelli , Giorgio Saracco

Isoperimetric robots are large scale, untethered inflatable robots that can undergo large shape changes, but have only been demonstrated in one 3D shape -- an octahedron. These robots consist of independent triangles that can change shape…

Robotics · Computer Science 2025-05-06 Nathan Usevitch , Isaac Weaver , James Usevitch

In an Euclidean $d$-space, the container problem asks to pack $n$ equally sized spheres into a minimal dilate of a fixed container. If the container is a smooth convex body and $d\geq 2$ we show that solutions to the container problem can…

Metric Geometry · Mathematics 2011-10-20 Achill Schuermann

We present a 3D stylization algorithm that can turn an input shape into the style of a cube while maintaining the content of the original shape. The key insight is that cubic style sculptures can be captured by the as-rigid-as-possible…

Graphics · Computer Science 2020-06-30 Hsueh-Ti Derek Liu , Alec Jacobson

We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…

Metric Geometry · Mathematics 2011-10-20 Karoly Bezdek , Zsolt Langi , Marton Naszodi , Peter Papez

This paper is concerned with the application of a spacetime structure to a three-dimensional quantum system. There are three components. First, the main part of this paper presents the constraint conditions which build the relation of a…

High Energy Physics - Theory · Physics 2016-01-01 De-Hone Lin

In this paper we study the problem of augmenting a planar graph such that it becomes 3-regular and remains planar. We show that it is NP-hard to decide whether such an augmentation exists. On the other hand, we give an efficient algorithm…

Combinatorics · Mathematics 2012-09-19 Tanja Hartmann , Jonathan Rollin , Ignaz Rutter

In this article we introduce the notion of a balloon animal map between broken toric varieties and construct several long exact sequences in cohomology related to them. We give a new proof of the deletion-contraction relation on hypertoric…

Algebraic Geometry · Mathematics 2025-09-17 Evan Sundbo

A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of polynomial equations is described.

Combinatorics · Mathematics 2007-05-23 Baris Altunkaynak

We prove that if $X$ is a real Banach space, with $\dim X\geq 3$, which contains a subspace of codimension 1 which is 1-complemented in $X$ and whose group of isometries is almost transitive then $X$ is isometric to a Hilbert space. This…

Functional Analysis · Mathematics 2007-05-23 Beata Randrianantoanina

In the Colored Bin Packing problem a set of items with varying weights and colors must be packed into bins of uniform weight limit such that no two items of the same color may be packed adjacently within a bin. We solve this problem for the…

Data Structures and Algorithms · Computer Science 2015-11-17 Hamza Alsarhan , Davin Chia , Ananya Christman , Shannia Fu , Yanfeng Jin

In programmable matter, we consider a large number of tiny, primitive computational entities called particles that run distributed algorithms to control global properties of the particle structure. Shape formation problems, where the…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-01-29 Matthias Artmann , Andreas Padalkin , Christian Scheideler

We consider methods for connected reconfigurations by finite automate in the so-called \emph{hybrid} or \emph{Robot-on-Tiles} model of programmable matter, in which a number of simple robots move on and rearrange an arrangement of passive…

Computational Geometry · Computer Science 2019-09-10 Sándor P. Fekete , Eike Niehs , Christian Scheffer , Arne Schmidt

A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ball-polyhedron as the union of vertices, edges, and faces defined in a rather…

Metric Geometry · Mathematics 2013-02-13 Karoly Bezdek , Marton Naszodi

Framing an issue as a puzzle, problem, or mess is an illustrative approach to characterizing the issue's complexity within organizational theory and systems thinking. We use this approach to characterize the issue of designing collective…

Robotics · Computer Science 2024-10-31 David Garzón Ramos , Sabine Hauert

In this paper, we propose a three-component Camassa-Holm (3CH) system with cubic nonlinearity and peakons. The 3CH model is proven integrable in the sense of Lax pair, Hamiltonian structure, and conservation laws. We show that this system…

Exactly Solvable and Integrable Systems · Physics 2015-04-21 Baoqiang Xia , Ruguang Zhou , Zhijun Qiao

A perfect cuboid is formed when an Euler brick whose edges and face diagonals are all integers also has an integer internal diagonal. It is known that if a perfect cuboid exists the internal diagonal is odd. No perfect cuboid has been…

General Mathematics · Mathematics 2024-01-17 Ivor Lloyd

We study entropy numbers and box dimension of (the image of) homogeneous polynomials and holomorphic functions between Banach spaces. First, we see that entropy numbers and box dimensions of subsets of Banach spaces are related. We show…

Functional Analysis · Mathematics 2024-01-23 Daniel Carando , Carlos D'Andrea , Leodan A. Torres , Pablo Turco
‹ Prev 1 4 5 6 7 8 10 Next ›