geodesic_distance.c File Reference

#include <volume_io/internal_volume_io.h>
#include <bicpl/geom.h>
#include <bicpl/priority_queue.h>

Include dependency graph for geodesic_distance.c:

Go to the source code of this file.

Functions
public int	compute_distances_from_point (polygons_struct *polygons, int n_neighbours[], int *neighbours[], Point *point, int poly, Real max_distance, BOOLEAN distances_initialized, float distances[], int *list[])
	Compute distance in mesh structure.

---

Function Documentation

public int compute_distances_from_point (  polygons_struct *  polygons, int  n_neighbours[], int *  neighbours[], Point *  point, int  poly, Real  max_distance, BOOLEAN  distances_initialized, float  distances[], int *  list[] )

Compute distance in mesh structure. Compute single-source shortest path distances in the graph using Dijkstra's algorithm. If the upper bound (max_distance) is positive, then the search is terminated once this bound is reached. Definition at line 30 of file geodesic_distance.c. References DELETE_PRIORITY_QUEUE, distance_between_points(), polygons_struct::end_indices, find_polygon_with_vertex(), GET_OBJECT_SIZE, polygons_struct::indices, INITIALIZE_PRIORITY_QUEUE, INSERT_IN_PRIORITY_QUEUE, IS_PRIORITY_QUEUE_EMPTY, lookup_polygon_vertex(), polygons_struct::n_points, POINT_INDEX, polygons_struct::points, PRIORITY_QUEUE_STRUCT, and REMOVE_FROM_PRIORITY_QUEUE. Referenced by get_smooth_surface_curvature().

---