Flow complex: general structure and algorithm

K. Buchin; J. Giesen

Flow complex: general structure and algorithm

K. Buchin
, J. Giesen

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

4 Citaten (Scopus)

1 Downloads (Pure)

Samenvatting

The flow complex is a data structure, similar to the Delaunay triangulation, to organize a set of (weighted) points in Rd. Its structure has been examined in detail in two and three dimensions but only little is known about its structure in general. Here we propose the first algorithm for computing the flow complex in any dimension which reflects its recursive structure. On the basis of the algorithm we give a generalized and simplified proof of the homotopy equivalence of alpha- and flow-shapes.

Originele taal-2	Engels
Titel	Proceedings 17th Canadian Conference on Computational Geometry (CCCG'05, Windsor, Ontario, Canada, August 10-12, 2005), Electronic proceedings
Uitgeverij	The CCCG Library
Pagina's	270-273
Status	Gepubliceerd - 2005

Citeer dit

@inproceedings{90351eb93f2c45ec831003178b16a160,

title = "Flow complex: general structure and algorithm",

abstract = "The flow complex is a data structure, similar to the Delaunay triangulation, to organize a set of (weighted) points in Rd. Its structure has been examined in detail in two and three dimensions but only little is known about its structure in general. Here we propose the first algorithm for computing the flow complex in any dimension which reflects its recursive structure. On the basis of the algorithm we give a generalized and simplified proof of the homotopy equivalence of alpha- and flow-shapes.",

author = "K. Buchin and J. Giesen",

year = "2005",

language = "English",

pages = "270--273",

booktitle = "Proceedings 17th Canadian Conference on Computational Geometry (CCCG'05, Windsor, Ontario, Canada, August 10-12, 2005), Electronic proceedings",

publisher = "The CCCG Library",

}

TY - GEN

T1 - Flow complex: general structure and algorithm

AU - Buchin, K.

AU - Giesen, J.

PY - 2005

Y1 - 2005

N2 - The flow complex is a data structure, similar to the Delaunay triangulation, to organize a set of (weighted) points in Rd. Its structure has been examined in detail in two and three dimensions but only little is known about its structure in general. Here we propose the first algorithm for computing the flow complex in any dimension which reflects its recursive structure. On the basis of the algorithm we give a generalized and simplified proof of the homotopy equivalence of alpha- and flow-shapes.

AB - The flow complex is a data structure, similar to the Delaunay triangulation, to organize a set of (weighted) points in Rd. Its structure has been examined in detail in two and three dimensions but only little is known about its structure in general. Here we propose the first algorithm for computing the flow complex in any dimension which reflects its recursive structure. On the basis of the algorithm we give a generalized and simplified proof of the homotopy equivalence of alpha- and flow-shapes.

M3 - Conference contribution

SP - 270

EP - 273

BT - Proceedings 17th Canadian Conference on Computational Geometry (CCCG'05, Windsor, Ontario, Canada, August 10-12, 2005), Electronic proceedings

PB - The CCCG Library

ER -

Flow complex: general structure and algorithm

Samenvatting

Vingerafdruk

Citeer dit