Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
On Landmark Distances in Polygons
C. Gotsman
, K. Hormann
Computer Science
Office of the Dean - YWCC
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On Landmark Distances in Polygons'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximate Geodesics
16%
Autonomous Agents
16%
Discrete Set
16%
Distance Function
33%
Geodesic Distance
16%
Geodesic Path
16%
Greedy Routing
16%
Local Minima
33%
Maximum Principle
16%
Minimal Geodesic
16%
Planar Polygon
16%
Polygon
100%
Robotic Navigation
16%
Shortest Path
16%
Simply Connected
16%
Steepest Descent
33%
Steepest Descent Path
16%
Triangulation
33%
Two-component Domains
16%
Two-point
33%
Computer Science
Approximate Computing
33%
Autonomous Agent
33%
Distance Function
66%
Geodesic Distance
33%
Geodesics
33%
Local Minimum
66%
Maximum Principle
33%
Routing Algorithm
33%
Steepest Descent
100%
Mathematics
Approximates
14%
Distance Function
28%
Edge
28%
Geodesic Path
14%
Local Minimum
28%
Polygon
100%
Steepest Descent
42%