We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface are measured either by the length of a Euclidean shortest path or by link distance
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in t...
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in t...
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in t...
We develop algorithms to compute shortest path edge sequences, Voronoi diagrams, the Fréchet distanc...
We develop algorithms to compute shortest path edge sequences, Voronoi diagrams, the Fréchet distanc...
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fr´echet ...
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fr´echet ...
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fr´echet ...
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fr´echet ...
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fr´echet ...
We develop algorithms to compute shortest path edge sequences, Voronoi diagrams, the Fréchet distanc...
We develop algorithms to compute shortest path edge sequences, Voronoi diagrams, the Fréchet distanc...
Several algorithms are presented to compute the shortest cost path between two points, s and t, on a...
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in t...
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in t...
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in t...
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in t...
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in t...
We develop algorithms to compute shortest path edge sequences, Voronoi diagrams, the Fréchet distanc...
We develop algorithms to compute shortest path edge sequences, Voronoi diagrams, the Fréchet distanc...
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fr´echet ...
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fr´echet ...
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fr´echet ...
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fr´echet ...
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fr´echet ...
We develop algorithms to compute shortest path edge sequences, Voronoi diagrams, the Fréchet distanc...
We develop algorithms to compute shortest path edge sequences, Voronoi diagrams, the Fréchet distanc...
Several algorithms are presented to compute the shortest cost path between two points, s and t, on a...
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in t...
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in t...
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in t...
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in t...
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in t...
DOI
Add to ORKG