Triangulation Algorithm Based on Empty Convex Set Condition

Vestnik Volgogradskogo gosudarstvennogo universiteta. Serija 1. Mathematica. Physica
doi 10.15688/jvolsu1.2015.3.3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Volgograd State University

Related search

Research on Algorithm of the Point Set in the Plane Based on Delaunay Triangulation

American Journal of Computational Mathematics
2012English

2-Convex Polyominoes: Non-Empty Corners

Open Journal of Discrete Mathematics
2019English

Feature Extraction Algorithm Based on Sample Set Reconstruction

2013English

The Empty Left Edge Condition

Exploring Crash-Proof Grammars
2010English

A Novel Hole Filling Method Based on Projection Onto Convex Set in DIBR

2013English

Rough Set Theory in Discretization Method Based on Genetic Algorithm

2015English

Reconstruction of 2-Convex Polyominoes With Non-Empty Corners

Open Journal of Discrete Mathematics
2019English

On Set Correspondences Into Uniformly Convex Banach Spaces

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1972English

On Embedding a Compact Convex Set Into a Locally Convex Topological Vector Space

Pacific Journal of Mathematics
Mathematics
1976English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy