Computer Science
6 years ago

New algorithm cuts travel time in half on Delaunay Triangulation!

Discrete & Computational Geometry
Improved Routing on the Delaunay Triangulation
Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel Smid

Paper Summary

A new algorithm has been developed to find the shortest path between two points on a geometric graph called the Delaunay triangulation. This algorithm ensures that the path found is not longer than 3.56 times the direct distance between the two points, which is an improvement over the previous limit of 5.9 times the direct distance.

Related papers

Theme background image
Social Sciences
8 years ago

New algorithm creates perfect triangulation for complex polygons effortlessly.

Geographic Information
Process Optimization
Theme background image
Computer Science
8 years ago

Revolutionizing Delaunay Triangulation: Solving for Points Outside the Framework!

Mesh Generation
Motion Planning
Trajectory Analysis
Theme background image
Computer Science
8 years ago

New algorithm revolutionizes fast construction of complex geometric structures.

Mesh Generation
Trajectory Analysis
SLAM