✦ LIBER ✦

Efficient dynamic algorithms for some geometric intersection problems

✍ Scribed by Siu Wing Cheng; Ravi Janardan

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 705 KB
Volume: 36
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90151-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Theoretic and Practical Algori

Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems

✍ Harold N. Gabow; Ying Xu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 754 KB

Efficient algorithms for the matroid intersection problem, both cardinality and weighted versions, are presented. The algorithm for weighted intersection works by scaling the weights. The cardinality algorithm is a special case, but takes advantage of greater structure. Efficiency of the algorithms

Approximation algorithms for geometric m

Approximation algorithms for geometric median problems

✍ Jyh-Han Lin; Jeffrey Scott Vitter 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 359 KB

An efficient algorithm for some tree mat

An efficient algorithm for some tree matching problems

✍ Fabrizio Luccio; Linda Pagli 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 788 KB

An alternating digital tree (ADT) algori

An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems

✍ Javier Bonet; Jaime Peraire 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 951 KB

On Dynamic Algorithms for Algebraic Prob

On Dynamic Algorithms for Algebraic Problems

✍ John H. Reif; Stephen R. Tate 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 221 KB

In this paper, we examine the problem of incrementally evaluating algebraic Ž . Ž . functions. In particular, if f x , x , . . . ,

Some Efficient Algorithms for Permutatio

Some Efficient Algorithms for Permutation Graphs

✍ O.H. Ibarra; Q. Zheng 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 685 KB