𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for finding the centers of conics and quadrics in noisy data

✍ Scribed by Chanchal Chatterjee; Edwin K.P. Chong

Book ID
108363671
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
958 KB
Volume
30
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Geometric Algorithms for Detecting and C
Geometric Algorithms for Detecting and Calculating All Conic Sections in the Intersection of Any 2 Natural Quadric Surfaces
✍ J.R. Miller; R.N. Goldman πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 916 KB

One of the most challenging aspects of the surface-surface intersection problem is the proper disposition of degenerate configurations. Even in the domain of quadric surfaces, this problem has proven to be quite difficult. The topology of the intersection as well as the basic geometric representatio

Efficient Algorithms for Finding the Max
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
✍ Wun-Tat Chan; Francis Y.L. Chin πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 366 KB

In a rectangular grid, given two sets of nodes, S S sources and T T sinks , of size 2 Ε½ . each, the disjoint paths DP problem is to connect as many nodes in S S to the Ε½ nodes in T T using a set of ''disjoint'' paths. Both edge-disjoint and Β¨ertex-disjoint . cases are considered in this paper. Note