Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization

24 Jan 2020 Nakahata Yu Horiyama Takashi Minato Shin-ichi Yamanaka Katsuhisa

Given $n$ points in the plane, we propose algorithms to compile connected crossing-free geometric graphs into directed acyclic graphs (DAGs). The DAGs allow efficient counting, enumeration, random sampling, and optimization... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTATIONAL GEOMETRY

Datasets


  Add Datasets introduced or used in this paper