Abstract | ||
---|---|---|
Given a set \Theta of ff i (i = 1; 2; : : : ; k) orientations (angles) in theplane, one can define a distance function which induces a metric inthe plane, called the orientation metric [3]. In the special case whereall the angles are equal, we call the metric a uniform orientation metric[2]. Specifically, if there are oe orientations, forming anglesioe; 0 i oe \Gamma 1, with the x-axis, where oe 2 is an integer, we call the metric oe -metric. Note that the 2 -metric is the... |
Year | DOI | Venue |
---|---|---|
1997 | 10.1006/jcss.1997.1513 | J. Comput. Syst. Sci. |
Keywords | DocType | Volume |
steiner tree problem,orientation metrics,distance function | Journal | 55 |
Issue | ISSN | Citations |
3 | Journal of Computer and System Sciences | 10 |
PageRank | References | Authors |
1.08 | 18 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
G. Y. Yan | 1 | 11 | 1.43 |
Andreas A Albrecht | 2 | 164 | 31.44 |
G. H. F. Young | 3 | 10 | 1.08 |
C. K. Wong | 4 | 1459 | 513.44 |