On Monotone Sequences of Directed Flips, Triangulations of Polyhedra, and Structural Properties of a Directed Flip Graph

09/25/2018 ∙ by Hang Si, et al. ∙ 0

In this paper, we present some rather basic and fundamental results on sequence of flips and triangulations of polyhedra. We studied the stricture properties of a directed flip graph. The result explains clearly the behaviour of classical Lawson's flip algorithm. As an application, we describe a simple algorithm to triangulate a special class of 3d non-convex polyhedra.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.