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

page 1

page 2

page 3

page 4

research
08/19/2020

On directed analogues of expander and hyperfinite graph sequences

We introduce and study analogues of expander and hyperfinite graph seque...
research
11/06/2018

Characterizations and Directed Path-Width of Sequence Digraphs

Computing the directed path-width of a directed graph is an NP-hard prob...
research
11/06/2017

Directed Graph Embeddings

Definitions of graph embeddings and graph minors for directed graphs are...
research
05/12/2020

Artificial life properties of directed interaction combinators vs. chemlambda

We provide a framework for experimentation at https://mbuliga.github.io/...
research
04/16/2021

Minimum Cuts in Directed Graphs via √(n) Max-Flows

We give an algorithm to find a mincut in an n-vertex, m-edge weighted di...
research
11/27/2021

On lossy Compression of Directed Graphs

The method of types presented by Csiszar and Korner is a central tool us...
research
11/03/2017

Phototactic Supersmarticles

Smarticles, or smart active particles, are small robots equipped with on...

Please sign up or login with your details

Forgot password? Click here to reset