✦ LIBER ✦

Partitions of a Polytope and Mappings of a Point Set to Facets

✍ Scribed by Roman N. Karasev

Publisher: Springer
Year: 2005
Tongue: English
Weight: 256 KB
Volume: 34
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-005-1158-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Polytope of Non-Crossing Graphs on a

The Polytope of Non-Crossing Graphs on a Planar Point Set

✍ David Orden; Francisco Santos 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 355 KB

A Parallel Algorithm for Partitioning a

A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters

✍ Muhammad H. Alsuwaiyel 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 163 KB

A method to find a point of a convex set

✍ R. F. Khabibullin 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 421 KB

A recursive algorithm for finding the mi

A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes

✍ Kazuyuki Sekitani; Yoshitsugu Yamamoto 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 807 KB

The product of the distances of a point

The product of the distances of a point inside a regular polytope to its vertices

✍ Gulbank D. Chakerian; Murray S. Klamkin 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 90 KB

On the Determination of Minimal Facets a

On the Determination of Minimal Facets and Edges of a Polyhedral Set

✍ JOHANNES JAHN 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB 👁 2 views

In this paper we investigate the image of a polyhedral set under a linear map. Moreover, we present an algorithm for the determination of so-called minimal facets and certain minimal irredundant proper edges of a convex polyhedral set in IR 3 . & 1997 by John Wiley & Sons, Ltd.