Abstract
We give an algorithm to compute all the local peaks in the k-level of an arrangement of n lines in O(n log n) + Õ((kn)2/3) time. We can also find τ largest peaks in O(n log2 n) + Õ((τn)2/3) time. Moreover, we consider the longest edge in a parametric minimum spanning tree (in other words, a bottleneck edge for connectivity), and give an algorithm to compute the parameter value (within a given interval) maximizing/minimizing the length of the longest edge in MST. The time complexity is Õ(n8/7k1/7 + nk1/3).
| Original language | English |
|---|---|
| Pages | 241-248 |
| Number of pages | 8 |
| Publication status | Published - 2001 Jan 1 |
| Event | 17th Annual Symposium on Computational Geometry (SCG'01) - Medford, MA, United States Duration: 2001 Jun 3 → 2001 Jun 5 |
Other
| Other | 17th Annual Symposium on Computational Geometry (SCG'01) |
|---|---|
| Country | United States |
| City | Medford, MA |
| Period | 01/6/3 → 01/6/5 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Computational Mathematics
Fingerprint Dive into the research topics of 'Notes on computing peaks in k-levels and parametric spanning trees'. Together they form a unique fingerprint.
Cite this
Katoh, N., & Tokuyama, T. (2001). Notes on computing peaks in k-levels and parametric spanning trees. 241-248. Paper presented at 17th Annual Symposium on Computational Geometry (SCG'01), Medford, MA, United States.