The triangulation algorithm consists of two parts. In a pop-out phase we identify vertices of small degree that are not hindered by other vertices and remove them one by one, much like we would pull out a ski hat off someone's head. This pruning operation reduces the size of the polytope to O(r).
The polytopes arising in standard application areas tend to be almost convex, and this fact should be used to one's advantage. For example, a triangulation of ...
and r reflex edges is triangulated into O(n + r²) pieces. The running time is O((n+r²) log r). The algorithm is very simple and we believe that it will be ...
Oct 1, 1990 · Our main result is an algorithm for decomposing a nonconvex polytope of zero genus withn vertices andr reflex edges intoO(n +r 2) tetrahedra.
Chazelle, B., and Palios, L.. "Triangulating a Nonconvex Polytope.." Discrete & computational geometry 5.5 (1990): 505-526. <http://eudml.org/doc/131134>.
This paper is concerned with the problem of partitioning a three-dimensional polytope into a small number of ele- mentary convex parts.
Triangulating a Nonconvex Polytope. Chazelle, B.; Palios, L. pp. 505 - 526. Terms and Conditions. The Göttingen State and University Library provides access ...
Not every nonconvex polytope can be triangulated without additional vertices. One classical example is Schönhardt's 3-polytope [Sch28] [DRS10, Example 3.6.1]: a ...
A new parallel algorithm for the triangulation of a nonconvex polytope P is presented. It will be shown that P can be decomposed into O(n+r2) tetrahedra ...
Mar 14, 2018 · I'm starting with a single 2D triangle that I want to clip with a (potentially) convex 2D polygon. It's not self-intersecting, but may 'keep' or 'discard' the ...
Missing: Polytope. | Show results with:Polytope.