HIGHLIGHTS
- who: Joachim Gudmundsson and collaborators from the The University of Sydney, Australia have published the research work: Approximating the Packedness of Polygonal Curves, in the Journal: (JOURNAL)
- what: In the case d = 2 the authors develop a faster algorithm that returns a (6 + u03b5)-approximation and runs in O((n/u03b53 )4/3 polylog(n/u03b5))) time. The authors provide two sub-cubic time approximation algorithms for the packedness of a polygonal curve. Next, the authors show S is not too much larger than H: u03b5 u03b5 u03b5 u00b7 |ab| 6 rH + |ap| + |bq| + u00b7 . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.