✦ LIBER ✦

Finding the upper envelope of n line segments in O(n log n) time

✍ Scribed by John Hershberger

Book ID: 103105303
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 897 KB
Volume: 33
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90136-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding neighbors on bincode-based image

Finding neighbors on bincode-based images in O (n log log n) time

✍ Kuo-Liang Chung; Chi-Yen Huang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 440 KB

Constructing the visibility graph for n-

Constructing the visibility graph for n-line segments in O(n2) time

✍ Emo Welzl 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 393 KB

On-Line Construction of Two-Dimensional

On-Line Construction of Two-Dimensional Suffix Trees in O(n2log n) Time

✍ Joong Chae Na; Raffaele Giancarlo; Kunsoo Park 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 226 KB

The cover time of a regular expander is

The cover time of a regular expander is O(n log n)

✍ Ronitt Rubinfeld 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 244 KB

Computation of geometric properties from

Computation of geometric properties from the medial axis transform in O(n log n) time

✍ Angela Y Wu 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 93 KB

An algorithm to solve the m × n assignme

An algorithm to solve the m × n assignment problem in expected time O(mn log n)

✍ Richard M. Karp 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB

## Abstract We give an algorithm to solve the __m__‐source, __n__‐destination assignment problem in expected time __O(mn__ log __n__) under the assumption that the edge costs are independent random variables and the costs of the edges incident with any given source are identically distributed. The