## Abstract

For a surface in 3-space that is represented by a set S of sample points, we construct a coarse approximating polytope P that uses a subset of S as its vertices and preserves the topology of. In contrast to surface reconstruction we do not use all the sample points, but we try to use as few points as possible. Such a polytope P is useful as a 'seed polytope' for starting an incremental refinement procedure to generate better and better approximations of based on interpolating subdivision surfaces or e.g. Bézier patches. Our algorithm starts from an r-sample S of. Based on S, a set of surface covering balls with maximal radii is calculated such that the topology is retained. From the weighted α-shape of a proper subset of these highly overlapping surface balls we get the desired polytope. As there is a rather large range for the possible radii for the surface balls, the method can be used to construct triangular surfaces from point clouds in a scalable manner. We also briefly sketch how to combine parts of our algorithm with existing medial axis algorithms for balls, in order to compute stable medial axis approximations with scalable level of detail.

Originalsprache | englisch |
---|---|

Seiten (von - bis) | 1349-1360 |

Seitenumfang | 12 |

Fachzeitschrift | Computer Graphics Forum |

Jahrgang | 28 |

Ausgabenummer | 5 |

DOIs | |

Publikationsstatus | Veröffentlicht - Juli 2009 |

Veranstaltung | 2009 Eurographics Symposium on Geometry Processing - Berlin, Deutschland Dauer: 15 Juli 2009 → 17 Juli 2009 |

## Schlagwörter

- Discrete and Computational Geometry

## ASJC Scopus subject areas

- Computergrafik und computergestütztes Design