๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing a Segment Center for a Planar Point Set

โœ Scribed by P.K. Agarwal; A. Efrat; M. Sharir; S. Toledo

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
468 KB
Volume
15
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The santalo point of a planar convex set
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)

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