Partial construction of an arrangement of lines and its application to optimal partitioning of bichromatic point set

Tetsuo Asano, Takeshi Tokuyama

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

This paper presents an efficient algorithm for construction at-most-k levels of an arrangement of n lines in the plane in ime O(nk + nlogn), which is optimal since Ω(nk) line segments are included there. The algorithm can sweep the at-most-k levels of the arrangement using O(n) space. Although Everett recently gave an algorithm for constructing the at-most-k levels with the same time complexity independently, our algorithm is superior with respect to the space complexity as a sweep algorithm. Then, we apply the algorithm to a bipartitioning problem of a bichromatic point set.

Original languageEnglish
Pages (from-to)595-600
Number of pages6
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE77-A
Issue number4
Publication statusPublished - 1994 Apr 1

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Partial construction of an arrangement of lines and its application to optimal partitioning of bichromatic point set'. Together they form a unique fingerprint.

Cite this