z-logo
open-access-imgOpen Access
JAVA Implementation for Triangulation of Convex Polygon Based on Lukasiewicz’s Algorithm and Binary Trees
Author(s) -
Muzafer Saračević,
Sead Mašović,
Danijela Milošević
Publication year - 2013
Publication title -
southeast europe journal of soft computing
Language(s) - English
Resource type - Journals
ISSN - 2233-1859
DOI - 10.21533/scjournal.v2i2.26
Subject(s) - polygon (computer graphics) , triangulation , binary number , regular polygon , pitteway triangulation , notation , computer science , java , algorithm , convex polygon , mathematics , combinatorics , delaunay triangulation , programming language , geometry , arithmetic , telecommunications , frame (networking)

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