Notes on computing peaks in k-levels and parametric spanning trees

N. Katoh, T. Tokuyama

Research output: Contribution to conferencePaper

5 Citations (Scopus)

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 languageEnglish
Pages241-248
Number of pages8
Publication statusPublished - 2001 Jan 1
Event17th Annual Symposium on Computational Geometry (SCG'01) - Medford, MA, United States
Duration: 2001 Jun 32001 Jun 5

Other

Other17th Annual Symposium on Computational Geometry (SCG'01)
CountryUnited States
CityMedford, MA
Period01/6/301/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.