|
This article is cited in 2 scientific papers (total in 2 papers)
Research Papers
Computation of a path with a minimal number of links in a given homotopy class between semi-algebraic obstacles in the plane
D. Yu. Grigor'evab, A. O. Slisenkocd a Department of Computer Science, Penn State University, University, PA
b St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences
c St. Petersburg Institute for Informatics and Automation of RAS
d Department of Informatics, Universite Paris-12, France
Received: 26.03.1997
Citation:
D. Yu. Grigor'ev, A. O. Slisenko, “Computation of a path with a minimal number of links in a given homotopy class between semi-algebraic obstacles in the plane”, Algebra i Analiz, 10:2 (1998), 124–147; St. Petersburg Math. J., 10:2 (1999), 315–332
Linking options:
https://www.mathnet.ru/eng/aa989 https://www.mathnet.ru/eng/aa/v10/i2/p124
|
Statistics & downloads: |
Abstract page: | 416 | Full-text PDF : | 389 | First page: | 1 |
|