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

Computing a median point of a simple rectilinear polygon

โœ Scribed by Victor Chepoi; Feodor Dragan

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
416 KB
Volume
49
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimally Computing the Shortest Weakly
Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
โœ Danny Z. Chen ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 209 KB

Given an n-vertex simple polygon P, the problem of computing the shortest weakly visible subedge of P is that of finding a shortest line segment s on the ลฝ . boundary of P such that P is weakly visible from s if s exists . In this paper, we present new geometric observations that are useful for solv

Exploiting self-canceling demand point a
Exploiting self-canceling demand point aggregation error for some planar rectilinear median location problems
โœ R.L. Francis; T.J. Lowe; M.B. Rayco; A. Tamir ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 190 KB

## Abstract When solving location problems in practice it is quite common to aggregate demand points into centroids. Solving a location problem with aggregated demand data is computationally easier, but the aggregation process introduces error. We develop theory and algorithms for certain types of