✦ LIBER ✦

The Blaschke-Steinhardt point of a planar convex set

✍ Scribed by M.J. Kaiser

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 728 KB
Volume: 28
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(94)00156-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The santalo point of a planar convex set

✍ M.J. Kaiser 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 505 KB

An algorithm is described to determine the minimum area polar set of a planar convex polygon described in terms of its vertices. We adopt a result due to Santalo to verify our minimizing solution, and then demonstrate the search procedure on a few examples. 'For triangular (and centrally symmetric)

The minimum feature point set representi

The minimum feature point set representing a convex polyhedral object

✍ Jin-Jang Leou; Wen-Hsiang Tsai 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 342 KB

Constructing the convex hull of a partia

Constructing the convex hull of a partially sorted set of points

✍ Michael T. Goodrich 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 802 KB

Finding the closest point to the origin

Finding the closest point to the origin in the convex hull of a discrete set of points

✍ Hanif D. Sherali; Gyunghyun Choi 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 788 KB

A criterion for the metrizability of a c

A criterion for the metrizability of a compact convex set in terms of the set of extreme points

✍ Brenda MacGibbon 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 416 KB

Off-line dynamic maintenance of the widt

Off-line dynamic maintenance of the width of a planar point set

✍ Pankaj K. Agarwal; Micha Sharir 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 967 KB

In this paper we present an efficient algorithm for the off-line dynamic maintenance of the width of a planar point set in the following restricted case: We are given a real parameter W and a sequence X = (a,, , a,,) of n insert and delete operations on a set S of points in R2, initially consisting