𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Adaptive subdivision algorithms for a set of Bézier triangles

✍ Scribed by Daniel J. Filip

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
424 KB
Volume
18
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

PERFORMANCE EVALUATION OF MULTICHANNEL A
PERFORMANCE EVALUATION OF MULTICHANNEL ADAPTIVE ALGORITHMS FOR LOCAL ACTIVE NOISE CONTROL
✍ M. DE DIEGO; A. GONZALEZ 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 525 KB

This paper deals with the development of a multichannel active noise control (ANC) system inside an enclosed space. The purpose is to design a real practical system which works well in local ANC applications. Moreover, the algorithm implemented in the adaptive controller should be robust, of low com

A standard task graph set for fair evalu
A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
✍ Takao Tobita; Hironori Kasahara 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 587 KB

A 'standard task graph set' is proposed for fair evaluation of multiprocessor scheduling algorithms. Developers of multiprocessor scheduling algorithms usually evaluate them using randomly generated task graphs. This makes it di cult to compare the performance of algorithms developed in di erent res

Adaptive algorithms for heading-assisted
Adaptive algorithms for heading-assisted radar tracking of manoeuvering targets: A comparative study
✍ Ioannis A. Marinitsis; Demetrios G. Lainiotis; Sokratis K. Katsikas 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 808 KB

Three different algorithms based on the multimodel partitioning approach are designed for the problem of tracking a manoeuvering target utilizing aircraft derived data (ADD) measurements of heading. These are subsequently evaluated with respect to their performance in the sense of the mean square es

Algorithms for a maximum clique and a ma
Algorithms for a maximum clique and a maximum independent set of a circle graph
✍ F. Gavril 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 523 KB

## Abstract Consider a family of chords in a circle. A circle graph is obtained by representing each chord by a vertex, two vertices being connected by an edge when the corresponding chords intersect. In this paper, we describe efficient algorithms for finding a maximum clique and a maximum indepen

Analysis of parallel algorithms for find
Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph
✍ H. Chen; A. M. Frieze 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB

It is well known [9] that finding a maximal independent set in a graph is in class J%, and [lo] that finding a maximal independent set in a hypergraph with fixed dimension is in %JV"%' . It is not known whether this latter problem remains in A% when the dimension is part of the input. We will study