### Abstract

Original language | English |
---|---|

Title of host publication | Mathematics of Surfaces |

Subtitle of host publication | 10th IMA International Conference, Leeds, UK, September 15-17, 2003. Proceedings |

Editors | M. Wilson, R. Martin |

Place of Publication | Berlin |

Publisher | Springer |

Pages | 48-72 |

ISBN (Electronic) | 978-3-540-39422-8 |

ISBN (Print) | 978-3-540-20053-6 |

DOIs | |

Publication status | Published - 15 Sep 2003 |

Externally published | Yes |

Event | 10th IMA International Conference on Mathematics of Surfaces: Mathematics of Surfaces - Leeds , United Kingdom Duration: 15 Sep 2003 → 17 Sep 2003 Conference number: 10 |

### Publication series

Name | Lecture notes in computer science |
---|---|

Volume | 2768 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 10th IMA International Conference on Mathematics of Surfaces |
---|---|

Abbreviated title | IMA 2003 |

Country | United Kingdom |

City | Leeds |

Period | 15/09/03 → 17/09/03 |

### Fingerprint

### Keywords

- METIS-217230

### Cite this

*Mathematics of Surfaces: 10th IMA International Conference, Leeds, UK, September 15-17, 2003. Proceedings*(pp. 48-72). (Lecture notes in computer science; Vol. 2768). Berlin: Springer. https://doi.org/10.1007/978-3-540-39422-8_5

}

*Mathematics of Surfaces: 10th IMA International Conference, Leeds, UK, September 15-17, 2003. Proceedings.*Lecture notes in computer science, vol. 2768, Springer, Berlin, pp. 48-72, 10th IMA International Conference on Mathematics of Surfaces, Leeds , United Kingdom, 15/09/03. https://doi.org/10.1007/978-3-540-39422-8_5

**Optimising Triangulated Polyhedral Surfaces with Self-intersections.** / Alboul, Lyuba.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Optimising Triangulated Polyhedral Surfaces with Self-intersections

AU - Alboul, Lyuba

PY - 2003/9/15

Y1 - 2003/9/15

N2 - We discuss an optimisation procedure for triangulated polyhedral surfaces (referred to as (2-3)D triangulations) which allows us to process self¿intersecting surfaces. As an optimality criterion we use minimisation of total absolute extrinsic curvature (MTAEC) and as a local transformation ¿ a diagonal flip, defined in a proper way for (2-3)D triangulations. This diagonal flip is a natural generalisation of the diagonal flip operation in 2D, known as Lawsons procedure. The difference is that the diagonal flip operation in (2-3)D triangulations may produce self-intersections. We analyze the optimisation procedure for (2-3)D closed triangulations, taking into account possible self¿intersections. This analysis provides a general insight on the structure of triangulations, allows to characterise the types of self¿intersections, as well as the conditions for global convergence of the algorithm. It provides also a new view on the concept of optimisation on the whole and is useful in the analysis of global and local convergence for other optimisation algorithms. At the end we present an efficient implementation of the optimality procedure for (2-3)D triangulations of the data, situated in the convex position, and conjecture possible results of this procedure for non¿convex data.

AB - We discuss an optimisation procedure for triangulated polyhedral surfaces (referred to as (2-3)D triangulations) which allows us to process self¿intersecting surfaces. As an optimality criterion we use minimisation of total absolute extrinsic curvature (MTAEC) and as a local transformation ¿ a diagonal flip, defined in a proper way for (2-3)D triangulations. This diagonal flip is a natural generalisation of the diagonal flip operation in 2D, known as Lawsons procedure. The difference is that the diagonal flip operation in (2-3)D triangulations may produce self-intersections. We analyze the optimisation procedure for (2-3)D closed triangulations, taking into account possible self¿intersections. This analysis provides a general insight on the structure of triangulations, allows to characterise the types of self¿intersections, as well as the conditions for global convergence of the algorithm. It provides also a new view on the concept of optimisation on the whole and is useful in the analysis of global and local convergence for other optimisation algorithms. At the end we present an efficient implementation of the optimality procedure for (2-3)D triangulations of the data, situated in the convex position, and conjecture possible results of this procedure for non¿convex data.

KW - METIS-217230

U2 - 10.1007/978-3-540-39422-8_5

DO - 10.1007/978-3-540-39422-8_5

M3 - Conference contribution

SN - 978-3-540-20053-6

T3 - Lecture notes in computer science

SP - 48

EP - 72

BT - Mathematics of Surfaces

A2 - Wilson, M.

A2 - Martin, R.

PB - Springer

CY - Berlin

ER -