Triangulation Algorithm Based on Empty Convex Set Condition
The article is devoted to generalization of Delaunay triangulation. We suggest to consider empty condition for special convex sets. For given finite set P ⊂ Rn we shall say that empty condition for convex set B ⊂ Rn is fullfiled if P ∩ B = P ∩ ∂B. Let Φ = Φα, α ∈ A be a family of compact convex set...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Volgograd State University
2015-11-01
|
| Series: | Vestnik Volgogradskogo Gosudarstvennogo Universiteta. Serija 1. Mathematica. Physica |
| Subjects: | |
| Online Access: | http://mp.jvolsu.com/index.php/en/component/attachments/download/440 |