graph - Planar Embedding (Planar Face Traversal) Algorithm in C# -


i have graph g. graph planar graph.

i wish find faces of graph. understand constructing planar embedding way find faces ( or regions, or cycles), such edges must shared @ 2 faces.

is there readily made implementation of planar embedding algorithm in c#? either commercial or open source fine.

after searching, found planar face traversal function in boost library suits needs.

one can wrap function in plain c manner , call c# via pinvoke.


Comments

Popular posts from this blog

asp.net - repeatedly call AddImageUrl(url) to assemble pdf document -

java - Android recognize cell phone with keyboard or not? -

iphone - How would you achieve a LED Scrolling effect? -