A fixed-parameter algorithm for the minimum Manhattan network problem
<p>A Manhattan network for a finite set <em>P</em> of points in the plane is a geometric graph such that its vertex set contains <em>P</em>, its edges are axis-parallel and non-crossing and, for any two points <em>p</em> and<em>q</em> in <em&g...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Carleton University
2011-12-01
|
| Series: | Journal of Computational Geometry |
| Online Access: | http://jocg.org/index.php/jocg/article/view/43 |