Domain Triangulation between Convex Polytopes | Zendy

Vasyl Tereshchenko | Zendy; С. В. Пилипенко | Zendy; Andriy Fisunenko | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Domain Triangulation between Convex Polytopes

Author(s) -

Vasyl Tereshchenko,

С. В. Пилипенко,

Andriy Fisunenko

Publication year - 2013

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2013.05.428

Subject(s) - delaunay triangulation , bowyer–watson algorithm , pitteway triangulation , constrained delaunay triangulation , minimum weight triangulation , computer science , point set triangulation , triangulation , surface triangulation , polyhedron , regular polygon , domain (mathematical analysis) , convex polytope , polytope , algorithm , convex optimization , mathematics , combinatorics , convex set , geometry , mathematical analysis

In this paper, we propose a method for solving the problem triangulation of a domain between convex polyhedrons in d- dimensional space using Delaunay triangulation in O(N2) time. Novelty of our work is in using a modified Delaunay triangulation algorithm with constraints

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