Difference between revisions of "Publications/geraud.05.ismm"
From LRDE
Line 1: | Line 1: | ||
{{Publication |
{{Publication |
||
− | | date = 2005 |
+ | | date = 2005-01-05 |
| authors = Thierry Géraud |
| authors = Thierry Géraud |
||
| title = Ruminations on Tarjan's Union-Find algorithm and connected operators |
| title = Ruminations on Tarjan's Union-Find algorithm and connected operators |
||
Line 13: | Line 13: | ||
| abstract = This papers presents a comprehensive and general form of the Tarjan's union-find algorithm dedicated to connected operators. An interesting feature of this form is to introduce the notion of separated domains. The properties of this form and its flexibility are discussed and highlighted with examples. In particular, we give clues to handle correctly the constraint of domain-disjointness preservation and, as a consequence, we show how we can rely on ``union-find'' to obtain algorithms for self-dual filters approaches and levelings with a marker function. |
| abstract = This papers presents a comprehensive and general form of the Tarjan's union-find algorithm dedicated to connected operators. An interesting feature of this form is to introduce the notion of separated domains. The properties of this form and its flexibility are discussed and highlighted with examples. In particular, we give clues to handle correctly the constraint of domain-disjointness preservation and, as a consequence, we show how we can rely on ``union-find'' to obtain algorithms for self-dual filters approaches and levelings with a marker function. |
||
| lrdekeywords = Image |
| lrdekeywords = Image |
||
+ | | lrdenewsdate = 2005-01-05 |
||
| type = inproceedings |
| type = inproceedings |
||
| id = geraud.05.ismm |
| id = geraud.05.ismm |
Revision as of 16:45, 5 November 2013
- Authors
- Thierry Géraud
- Where
- ismm05
- Place
- Paris, France
- Type
- inproceedings
- Publisher
- Springer
- Keywords
- Image
- Date
- 2005-01-05
Abstract
This papers presents a comprehensive and general form of the Tarjan's union-find algorithm dedicated to connected operators. An interesting feature of this form is to introduce the notion of separated domains. The properties of this form and its flexibility are discussed and highlighted with examples. In particular, we give clues to handle correctly the constraint of domain-disjointness preservation and, as a consequence, we show how we can rely on ``union-find to obtain algorithms for self-dual filters approaches and levelings with a marker function.
Bibtex (lrde.bib)
@InProceedings{ geraud.05.ismm, author = {Thierry G\'eraud}, title = {Ruminations on {T}arjan's {U}nion-{F}ind algorithm and connected operators}, booktitle = ismm05, year = 2005, address = {Paris, France}, month = apr, pages = {105--116}, publisher = {Springer}, series = {Computational Imaging and Vision}, volume = 30, project = {Image}, abstract = {This papers presents a comprehensive and general form of the Tarjan's union-find algorithm dedicated to connected operators. An interesting feature of this form is to introduce the notion of separated domains. The properties of this form and its flexibility are discussed and highlighted with examples. In particular, we give clues to handle correctly the constraint of domain-disjointness preservation and, as a consequence, we show how we can rely on ``union-find'' to obtain algorithms for self-dual filters approaches and levelings with a marker function.} }