Iyengar, S.S.,
Bettayab, S.,
Guest Eds., Special Issue On Design And Analysis Of Geometrical Algorithms For Robot Motion Planning And Vision,
TCS (140), No. 2, April 1995, pp. 201-331.
BibRef
Kirsch, D.,
The Intelligent Use Of Space,
AI(73), 1995, pp. 31-68.
BibRef
Lazanas, A.,
Latombe, J.C.,
Motion Planning With Uncertainty: A Landmark Approach,
AI(76), 1995, pp. 287-317.
BibRef
Shimaya, A.,
Interpreting Non-3d Line Drawings,
AI(77), 1995, pp. 1-41.
BibRef
Park, I.P.,
Kender, J.R.,
Topological Direction-Giving And Visual Navigation In Large Environments,
AI(78), 1995, pp. 355-395.
BibRef
Chou, S.Y.,
Woo, T.C.,
A Linear-Time Algorithm For Constructing A Circular Visibility Diagram,
Algorithmica(14), 1995, pp. 203-228.
BibRef
Lazanas, A.,
Latombe, J.C.,
Landmark-Based Robot Navigation,
Algorithmica(13), 1995, pp. 472-501.
BibRef
Cohn, A.G.,
The Challenge Of Qualitative Spatial Reasoning,
CS(27), 1995, pp. 323-325.
BibRef
de~Berg, M.,
Matousek, J.,
Schwartzkopf, O.,
Piecewise Linear Paths Among Convex Obstacles,
Discrete and Computational Geometry(14), 1995, pp. 9-29.
BibRef
Schmalz, M.S.,
A Simd-Parallel Model Of Hierarchical, Role-Based Pattern Recognition, With Application To The Optical Interpretation Of Natural Language,
IJES(7), 1994, pp. 405-421.
BibRef
Bourbakis, N.G.,
Knowledge Extraction And Acquisition During Real-Time Navigation In Unknown Environments,
IJPRAI(9), 1995, pp. 83-99.
BibRef
Kim, S.H.,
Park, J.H.,
Choi, S.H.,
Shin, S.Y.,
Chwa, K.Y.,
An Optimal Algorithm For Finding The Edge Visibility Polygon Under Limited Visibility,
IPL(53), 1995, pp. 359-365.
BibRef
Clementini, E.,
Di~Felice, P.,
A Comparison Of Methods For Representing Topological Relationships,
Information Sciences Applications(3), 1995, pp. 149-178.
BibRef
Rajasekaran, S.,
Ramaswami, S.,
Optimal Mesh Algorithms For The Voronoi Diagram Of Line Segments And Motion Planning In The Plane,
JPDC(26), 1995, pp. 99-115.
BibRef
Maio, D.,
Maltoni, D.,
Razzi, S.,
Topological Clustering Of Maps Using A Genetic Algorithm,
PRL(16), 1995, pp. 89-96.
BibRef
Rosenfeld, A.,
``Geometric Properties'' Of Sets Of Lines,
PRL(16), 1995, pp. 549-556.
BibRef
Latecki, L.,
Prokop, F.,
Semi-Proximity Continuous Functions In Digital Images,
PRL(16), 1995, pp. 1175-1187.
BibRef
Yang, C.D.,
Lee, D.T.,
Wong, C.K.,
Rectilinear Path Problems Among Rectilinear Obstacles Revisited,
SIAM JC(24), 1995, pp. 457-472.
BibRef
Atallah, M.J.,
Chen, D.Z.,
Optimal Parallel Hypercube Algorithms For Polygon Problems,
T-COMP(44), 1995, pp. 914-922.
BibRef
Dattasharma, A.,
Keerthi, S.S.,
An Augmented Voronoi Roadmap For 3d Translational Motion Planning For A Convex Polyhedron Moving Amidst Convex Polyhedral Obstacles,
TCS(140), 1995, pp. 205-230.
BibRef
Sarrafzadeh, M.,
Maddila, S.R.,
Discrete Warehouse Problem,
TCS(140), 1995, pp. 231-247.
BibRef
Rao, N.S.V.,
On Fast Planning Of Suboptimal Paths Amidst Polygonal Obstacles In The Plane,
TCS(140), 1995, pp. 265-289.
BibRef
de~Berg, M.,
Guibas, L.,
Halperin, D.,
Overmars, M.,
Schwartzkopf, O.,
Sharir, M.,
Teillaud, M.,
Reaching A Goal With Directional Uncertainty,
TCS(140), 1995, pp. 301-317.
BibRef
Shi, H.,
Ritter, G.X.,
A New Parallel Binary Image Shrinking Algorithm,
T-IP(4), 1995, pp. 224-226.
BibRef
Chen, D.Z.,
Efficient Geometric Algorithms On The Erew Pram,
T-PDS(6), 1995, pp. 41-47.
BibRef
Bhagavathi, D.,
Bokka, V.V.,
Gurla, H.,
Olariu, S.,
Schwing, J.L.,
Stojmenovic, I.,
Zhang, J.,
Time-Optimal Visibility-Related Algorithms Or Meshes With Multiple Broadcasting,
T-PDS(6), 1995, pp. 687-703.
BibRef
Shan, Y.,
Koren, Y.,
Obstacle Accommodation In Motion Planning,
T-RA(11), 1995, pp. 36-55.
BibRef
Fox, A.,
Hutchinson, S.,
Exploring Visual Constraints In The Synthesis Of Uncertainty-Tolerant Motion Plans,
T-RA(11), 1995, pp. 56-71.
BibRef
Barbehenn, M.,
Hutchinson, S.,
Efficient Search And Hierarchical Motion Planning By Dynamically Maintaining Single-Source Shortest Path(S) Trees,
T-RA(11), 1995, pp. 198-214.
BibRef
Fujimura, K.,
Time-Minimum Routes In Time-Dependent Networks,
T-RA(11), 1995, pp. 343-351.
BibRef
Kavraki, L.E.,
Computation Of Configuration-Space Obstacles Using The Fast Fourier Transform,
T-RA(11), 1995, pp. 408-413.
BibRef
Liu, Y.H.,
Arimoto, S.,
Finding The Shortest Path Of A Disc Among Polygonal Obstacles Using A Radius-Independent Graph,
T-RA(11), 1995, pp. 682-691.
BibRef
Desaulniers, G.,
Soumis, F.,
An Efficient Algorithm To Find A Shortest Path For A Car-Like Robot,
T-RA(11), 1995, pp. 819-828.
BibRef
Tirumalai, A.P.,
Schunck, B.G.,
Jain, R.C.,
Evidential Reasoning For Building Environment Maps,
T-SMC(25), 1995, pp. 10-20.
BibRef
Spence, R.,
Hutchinson, S.,
An Integrated Architecture For Robot Motion Planning And Control In The Presence Of Obstacles With Unknown Trajectories,
T-SMC(25), 1995, pp. 100-110.
BibRef
Krozel, J.,
Andrisani II., D.,
Intelligent $\Varepsilon$-Optimal Path Prediction For Vehicular Travel,
T-SMC(25), 1995, pp. 345-353.
BibRef
Beom, H.R.,
Cho, H.S.,
A Sensor-Based Navigation For A Mobile Robot Using Fuzzy Logic And Reinforcement Learning,
T-SMC(25), 1995, pp. 464-477.
BibRef
Conte, G.,
Zulli, R.,
Hierarchical Path Planning In A Multi-Robot Environment With A Simple Navigation Function,
T-SMC(25), 1995, pp. 651-654.
BibRef
Rao, N.S.V.,
Robot Navigation In Unknown Generalized Polygonal Terrain Using Vision Sensors,
T-SMC(25), 1995, pp. 947-962.
BibRef
Culik II, K.,
Kari, J.,
On The Power Of L-Systems In Image Generation,
Acta Informatica(31), 1994, pp. 761-773.
BibRef
Kim, C.,
Lee, D.H.,
Node Replacement Graph Languages Squeezed With Chains, Trees And Forests,
I&C(117), 1995, pp. 63-77.
BibRef
Nakamura, A.,
Some Notes On Parallel Coordinate Grammars,
IJPRAI(9), 1995, pp. 753-761.
BibRef
Subramanian, K.G.,
Siromoney, R.,
Dare, V.R.,
Saoudi, A.,
Basic Puzzle Languages,
IJPRAI(9), 1995, pp. 763-775.
BibRef
Ito, A.,
Inoue, K.,
Takanami, I.,
Wang, Y.,
The Effect Of Inkdots For Two-Dimensional Automata,
IJPRAI(9), 1995, pp. 777-796.
BibRef
Wang, Y.,
Inoue, K.,
Takanami, I.,
Cooperating Systems Of Three-Way Two-Dimensional Finite Automata,
IJPRAI(9), 1995, pp. 797-811.
BibRef
Jiang, T.,
Salomaa, A.,
Salomaa, K.,
Yu, S.,
Decision Problems For Patterns,
JCSS(50), 1995, pp. 53-63.
BibRef
Costagliola, G.,
Chang, S.K.,
Parsing Linear Pictorial Languages By Syntax-Directed Scanning,
Languages of Design(2), 1994, pp. 223-242.
BibRef
Tanaka, E.,
Theoretical Aspects Of Syntactic Pattern Recognition,
PR(28), 1995, pp. 1053-1061.
BibRef
Jumarie, G.,
Informational Similarity Of Graphs In Syntactic Pattern Recognition,
PRL(15), 1994, pp. 1177-1181.
BibRef
Ibarra, O.H.,
Pong, T.C.,
Sohn, S.M.,
A Note On Parsing Pattern Languages,
PRL(16), 1995, pp. 179-182.
BibRef
Remila, E.,
Recognition Of Graphs By Automata,
TCS(136), 1994, pp. 291-332.
BibRef
Ito, A.,
Inoue, K.,
Takanami, I.,
Wang, Y.,
Optimal Simulation Of Two-Dimensional Alternating Finite Automata By Three-Way Nondeterministic Turing Machines,
TCS(143), 1995, pp. 123-135.
BibRef
Clementi, A.,
Impagliazzo, R.,
The Reachability Problem For Finite Cellular Automata,
IPL(53), 1995, pp. 27-31.
BibRef
Durand, B.,
The Surjectivity Problem For 2d Cellular Automata,
JCSS(49), 1994, pp. 718-725.
BibRef
Sutner, K.,
On The Computational Complexity Of Finite Cellular Automata,
JCSS(50), 1995, pp. 87-97.
BibRef
Kari, J.,
Rice'S Theorem For The Limit Sets Of Cellular Automata,
TCS(127), 1994, pp. 229-254.
BibRef
Braga, G.,
Cattaneo, G.,
Flocchini, P.,
Quaranta Vogliotti, C.,
Pattern Growth In Elementary Cellular Automata,
TCS(145), 1995, pp. 1-26.
BibRef
Chapter on Rosenfeld Bibliography for 1995 continues in
A. Lightness, color and texture .