2000 character limit reached
Watersheds on edge or node weighted graphs "par l'exemple"
Published 7 Mar 2013 in cs.CV | (1303.1829v1)
Abstract: Watersheds have been defined both for node and edge weighted graphs. We show that they are identical: for each edge (resp.\ node) weighted graph exists a node (resp. edge) weighted graph with the same minima and catchment basin.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.