相关论文: The optimal way of folding a bond notebook page in…

We study the configuration space of rectangulations and convex subdivisions of $n$ points in the plane. It is shown that a sequence of $O(n\log n)$ elementary flip and rotate operations can transform any rectangulation to any other…

We introduce and study the random "locked" constraint satisfaction problems. When increasing the density of constraints, they display a broad "clustered" phase in which the space of solutions is divided into many isolated points. While the…

We consider the problem of wrapping three-dimensional solid bodies with a given planar sheet of paper, where the paper may be folded or wrinkled but not stretched or torn. We propose a conjecture characterising the maximumvolume solid…

A vertex model introduced by M. Bowick, P. Di Francesco, O. Golinelli, and E. Guitter (cond-mat/9502063) describing the folding of the triangular lattice onto the face centered cubic lattice has been studied in the hexagon approximation of…

This note initiates an investigation of packing links into a region of Euclidean space to achieve a maximal density subject to geometric constraints. The upper bounds obtained apply only to the class of homotopically essential links and…

This doctoral work focuses on three main problems related to social networks: (1) Orchestrating Network Formation: We consider the problem of orchestrating formation of a social network having a certain given topology that may be desirable…

The evaluation of web pages against a query is the pivot around which the Information Retrieval domain revolves around. The context sensitive, semantic evaluation of web pages is a non-trivial problem which needs to be addressed…

A k-page book embedding of a graph G draws the vertices of G on a line and the edges on k half-planes (called pages) bounded by this line, such that no two edges on the same page cross. We study the problem of determining whether G admits a…

The space in front of a projector or camera can be folded into a light-guide by total-internal reflection if the guide is tapered like a wedge. This article explains how to calculate both flat and curved wedges by scaling a thin version…

A concept of a rectangular diagram of a foliation in the three-sphere is introduced. It is shown that any co-orientable finite depth foliation in the complement of a link admits a presentation by a rectangular diagram compatible with the…

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

This paper considers an extension of origami geometry to the case of "folding" a three dimensional (3D) space along a plane. First, all possible incidence constraints between given points, lines and planes are analyzed by using the geometry…

In the graph balancing problem the goal is to orient a weighted undirected graph to minimize the maximum weighted in-degree. This special case of makespan minimization is NP-hard to approximate to a factor better than 3/2 even when there…

The degree-diameter problem consists of finding the maximum number of vertices $n$ of a graph with diameter $d$ and maximum degree $\Delta$. This problem is well studied, and has been solved for plane graphs of low diameter in which every…

A laterally confined thin elastic sheet lying on a liquid substrate displays regular undulations, called wrinkles, characterized by a spatially extended energy distribution and a well-defined wavelength $\lambda$. As the confinement…

We map the problem of determining flat-foldability of the origami diagram onto the ground-state search problem of spin glass model on random graphs. If the origami diagram is locally flat-foldable around each vertex, a pre-folded diagram,…

The properties of the interface in a phase-separated solution of polymers with different degrees of polymerization and Kuhn segment lengths are calculated. The starting point is the planar interface, the profile of which is calculated in…

We report an experimental study of the development of orientational order in a crumpled sheet, with a particular focus on the role played by the geometry of confinement. Our experiments are performed on elastomeric sheets immersed in a…

Simple closed curves in the plane can be mapped to nontrivial knots under the action of origami foldings that allow the paper to self-intersect. We show all tame knot types may be produced in this manner, motivating the development of a new…

The reassembling of a simple connected graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. Its simplest formulation is in two steps: (1) We cut every edge of G into two halves, thus obtaining a…