Modeling a class of 3-D objects using cycles of a graph
โ Scribed by S. Khalaf; P. Siy; M. Abdelguerfi
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 553 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0166-3615
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract Level set methods were proposed mainly by mathematicians for constructing a model of a 3D object of arbitrary topology. However, those methods are computationally inefficient due to repeated distance transformations and increased dimensions. In the paper, we propose a new method of mode
A digraph with n vertices and fixed outdegree m is generated randomly so that each such digraph is equally likely to be chosen. We consider the probability of the existence of a Hamiltonian cycle in the graph obtained by ignoring arc orientation. We show that there exists m (~23) such that a Hamilto