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

Separating two simple polygons by a sequence of translations

โœ Scribed by R. Pollack; M. Sharir; S. Sifrony

Publisher
Springer
Year
1988
Tongue
English
Weight
891 KB
Volume
3
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Computing a single cell in the overlay o
Computing a single cell in the overlay of two simple polygons
โœ Mark de Berg; Olivier Devillers; Katrin Dobrindt; Otfried Schwarzkopf ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 485 KB

This note combines the lazy randomized incremental construction scheme with the technique of "connectivity acceleration" to obtain an 0( n( log\* n)\*) time randomized algorithm to compute a single face in the overlay of two simple polygons in the plane. @

On Approximation by a Nonfundamental Seq
On Approximation by a Nonfundamental Sequence of Translates
โœ Badih Ghusayni ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 117 KB

If f t and its Fourier transform F t satisfy some growth conditions and if c n 0 is a sequence of distinct real numbers satisfying a certain separation condition, we ลฝ . represent those functions g t which are in the closure of the linear span of a ร„ ลฝ .4 ลฝ . nonfundamental sequence f c y t in L R .