Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Unobstructed shortest paths in polyhedral environments

From MaRDI portal
Publication:1102729
Jump to:navigation, search

zbMath0644.68003MaRDI QIDQ1102729

Varol Akman

Publication date: 1987

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)


zbMATH Keywords

computer graphicsVoronoi diagrammotion planningroboticscomputational geometryminimum paths


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Paths and cycles (05C38) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Software, source code, etc. for problems pertaining to combinatorics (05-04)


Related Items

An algorithmic approach to some problems in terrain navigation



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1102729&oldid=13138341"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 02:42.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki