2013
DOI: 10.1016/j.dam.2013.03.026
|View full text |Cite
|
Sign up to set email alerts
|

Discrete Geometry for Computer Imagery

Abstract: International audienc

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…In practice we use the Delaunay Triangulation [4] to get a navigation mesh on the map and then navigate the agents with A * algorithm. The exact process of A * algorithm could be seen in [2].…”
Section: Pathfinding Methods Mmentioning
confidence: 99%
See 1 more Smart Citation
“…In practice we use the Delaunay Triangulation [4] to get a navigation mesh on the map and then navigate the agents with A * algorithm. The exact process of A * algorithm could be seen in [2].…”
Section: Pathfinding Methods Mmentioning
confidence: 99%
“…Several methods have been developed to solve this problem. One method related to our work is to use triangular mesh [4] instead of grid world to decrease the computational cost [5]. Compared to continuous methods, discretized methods typically require smaller computational cost and have higher efficiency.…”
Section: Introductionmentioning
confidence: 99%