An Adaptive algorithm to compute the medial axis transform of 2-D polygonal domains
An adaptive algorithm to compute the medial axis transform of 2D polygonal domains with arbitrary genus is presented. The algorithm is based on the refinement of a coarse medial axis transform by subdividing the domain adaptively. The algorithm provides the medial axis represented by a set of triang...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1995 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/82486 |
| Acceso en línea: | https://hdl.handle.net/2117/82486 |
| Access Level: | acceso abierto |
| Palabra clave: | Adaptive algorithm Medial axis Àrees temàtiques de la UPC::Informàtica |
| Sumario: | An adaptive algorithm to compute the medial axis transform of 2D polygonal domains with arbitrary genus is presented. The algorithm is based on the refinement of a coarse medial axis transform by subdividing the domain adaptively. The algorithm provides the medial axis represented by a set of triangles of a predefined size and the closest boundary element. Examples of results are also presented to illustrate the method. |
|---|