find_cut_path.cpp File Reference

Namespaces
namespace	hmap

Functions
Path	hmap::find_cut_path_dijkstra (const Array &z, DomainBoundary start, DomainBoundary end, float dijk_elevation_ratio=0.9f, float dijk_distance_exponent=2.f, float dijk_upward_penalization=100.f, uint seed=0, bool favor_boundary_center=true, bool favor_lower_elevation=true, bool favor_sinks=true)
	Find a Dijkstra-based cut path between two domain boundaries.
Path	hmap::find_cut_path_midpoint (const Array &z, DomainBoundary start, DomainBoundary end, uint seed, float offset_ratio=0.2f, int steps=16, bool favor_boundary_center=true, bool favor_lower_elevation=true, bool favor_sinks=true)
	Generate a stochastic cut path using midpoint displacement.