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

Efficiently Approximating Polygonal Paths in Three and Higher Dimensions

โœ Scribed by G. Barequet, D. Z. Chen, O. Daescu, M. T. Goodrich and J. Snoeyink

Book ID
120136534
Publisher
Springer
Year
2002
Tongue
English
Weight
148 KB
Volume
33
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximating Polygonal Curves in Two an
Approximating Polygonal Curves in Two and Three Dimensions
โœ Kento Miyaoku; Koichi Harada ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 134 KB

We discuss the weighted minimum number polygonal approximation problem. Eu and Toussaint (1994, CVGIP: Graphical Models Image Process. 56, 231-246) considered this problem subject to the parallel-strip error criterion in R 2 with L q distance metrics, and they concluded that it can be solved in O(n

Efficiently Approximating the Minimum-Vo
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
โœ Gill Barequet; Sariel Har-Peled ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 221 KB

We present an efficient O n + 1/ฮต 4 5 -time algorithm for computing a 1 + ฮต)approximation of the minimum-volume bounding box of n points in 3 . We also present a simpler algorithm whose running time is O n log n + n/ฮต 3 . We give some experimental results with implementations of various variants of