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...

Descripción completa

Detalles Bibliográficos
Autores: Joan Arinyo, Robert|||0000-0002-1896-2940, Pérez Vidal, Lluís|||0000-0001-8666-0971, Gargallo Monllau, Elies
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
id ES_df5bfeef37982e96cd5c213ad19abcc9
oai_identifier_str oai:upcommons.upc.edu:2117/82486
network_acronym_str ES
network_name_str España
repository_id_str
spelling An Adaptive algorithm to compute the medial axis transform of 2-D polygonal domainsJoan Arinyo, Robert|||0000-0002-1896-2940Pérez Vidal, Lluís|||0000-0001-8666-0971Gargallo Monllau, EliesAdaptive algorithmMedial axisÀrees temàtiques de la UPC::InformàticaAn 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.19951995-10-0120162016-02-03reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/postscripthttps://hdl.handle.net/2117/82486reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/824862026-05-27T15:37:01Z
dc.title.none.fl_str_mv An Adaptive algorithm to compute the medial axis transform of 2-D polygonal domains
title An Adaptive algorithm to compute the medial axis transform of 2-D polygonal domains
spellingShingle An Adaptive algorithm to compute the medial axis transform of 2-D polygonal domains
Joan Arinyo, Robert|||0000-0002-1896-2940
Adaptive algorithm
Medial axis
Àrees temàtiques de la UPC::Informàtica
title_short An Adaptive algorithm to compute the medial axis transform of 2-D polygonal domains
title_full An Adaptive algorithm to compute the medial axis transform of 2-D polygonal domains
title_fullStr An Adaptive algorithm to compute the medial axis transform of 2-D polygonal domains
title_full_unstemmed An Adaptive algorithm to compute the medial axis transform of 2-D polygonal domains
title_sort An Adaptive algorithm to compute the medial axis transform of 2-D polygonal domains
dc.creator.none.fl_str_mv Joan Arinyo, Robert|||0000-0002-1896-2940
Pérez Vidal, Lluís|||0000-0001-8666-0971
Gargallo Monllau, Elies
author Joan Arinyo, Robert|||0000-0002-1896-2940
author_facet Joan Arinyo, Robert|||0000-0002-1896-2940
Pérez Vidal, Lluís|||0000-0001-8666-0971
Gargallo Monllau, Elies
author_role author
author2 Pérez Vidal, Lluís|||0000-0001-8666-0971
Gargallo Monllau, Elies
author2_role author
author
dc.subject.none.fl_str_mv Adaptive algorithm
Medial axis
Àrees temàtiques de la UPC::Informàtica
topic Adaptive algorithm
Medial axis
Àrees temàtiques de la UPC::Informàtica
description 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.
publishDate 1995
dc.date.none.fl_str_mv 1995
1995-10-01
2016
2016-02-03
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/82486
url https://hdl.handle.net/2117/82486
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/postscript
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869422057073147904
score 15,300719