✦ LIBER ✦

The decomposition of a square into rectangles of minimal perimeter

✍ Scribed by T.Y Kong; David M Mount; Michael Werman

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 331 KB
Volume: 16
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90061-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dissecting a square into rectangles of e

Dissecting a square into rectangles of equal area

✍ R. Häggkvist; P.-O. Lindberg; B. Lindström 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 275 KB

The largest minimal rectilinear steiner

The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter

✍ F. R. K. Chung; F. K. Hwang 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 444 KB 👁 2 views

Area and Perimeter Computation of the Un

Area and Perimeter Computation of the Union of a Set of Iso-rectangles in Parallel

✍ M.S. Kankanhalli; W.R. Franklin 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1001 KB

The Parametrization of Canal Surfaces an

The Parametrization of Canal Surfaces and the Decomposition of Polynomials into a Sum of Two Squares

✍ Günter Landsmann; Josef Schicho; Franz Winkler 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 675 KB

A canal surface in R 3 , generated by a parametrized curve C = m(t), is the Zariski closure of the envelope of the set of spheres with radius r(t) centered at m(t). This concept is a generalization of the classical notion of an offsets of a plane curve: first, the canal surface is a surface in 3-spa

On the decomposition of a minimally stro

On the decomposition of a minimally strongly h-connected digraph into h+1 acircuitic sub-graphs

✍ Yahya Ould Hamidoune 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 119 KB

We prove that every minimally strongly h-connected digraph can be decomposed into h + 1 acircuitic subgraphs. This result generalizes the following theorem of Mader. Every minimally h-connected graph is h + 1 colourable,

On the decomposition of a graph into sta

On the decomposition of a graph into stars

✍ Michael Tarsi 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 248 KB

It is known that whenever u(u -1) -0 (mod 2m) and u ~=2tn, the complete graph K, can be decomposed into edge disjoint, m-stars [l, 21. In this paper we prove that K, can be