z-logo
open-access-imgOpen Access
Triangulation Algorithm Based on Empty Convex Set Condition
Author(s) -
Klyachin Vladimir Aleksandrovich
Publication year - 2015
Publication title -
vestnik volgogradskogo gosudarstvennogo universiteta serija 1 mathematica physica
Language(s) - English
Resource type - Journals
eISSN - 2409-1782
pISSN - 2222-8896
DOI - 10.15688/jvolsu1.2015.3.3
Subject(s) - triangulation , minimum weight triangulation , regular polygon , convex set , algorithm , set (abstract data type) , computer science , convex polytope , mathematics , delaunay triangulation , convex optimization , constrained delaunay triangulation , geometry , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom