2D Shape similarity as a complement for Voronoi-Delone methods in shape reconstruction
In surface reconstruction from planar slices it is necessary to build surfaces between corresponding 2D regions in consecutive levels -- The problem has been traditionally attacked with (i) direct reconstruction based on local geometric proximity between the regions, and (ii) classification of topol...
- Autores:
-
Ruíz S., Óscar E.
Cadavid, Carlos A.
Granados, Miguel
Peña, Sebastián
Vásquez, Eliana
- Tipo de recurso:
- Fecha de publicación:
- 2005
- Institución:
- Universidad EAFIT
- Repositorio:
- Repositorio EAFIT
- Idioma:
- eng
- OAI Identifier:
- oai:repository.eafit.edu.co:10784/9672
- Acceso en línea:
- http://hdl.handle.net/10784/9672
- Palabra clave:
- TOPOLOGÍA
PROGRAMACIÓN HEURÍSTICA
PROCESAMIENTO DE IMÁGENES
PROCESAMIENTO DIGITAL DE IMÁGENES
Topology
Heuristic programming
Image processing
Topology
Heuristic programming
Image processing
Diagramas de Voronoi
Geometría computacional
Reconstrucción 3D
- Rights
- License
- Acceso cerrado
id |
REPOEAFIT2_d9c17055523b02737059adf3a1d67901 |
---|---|
oai_identifier_str |
oai:repository.eafit.edu.co:10784/9672 |
network_acronym_str |
REPOEAFIT2 |
network_name_str |
Repositorio EAFIT |
repository_id_str |
|
spelling |
2016-11-18T22:02:56Z20052016-11-18T22:02:56Z0097-8493http://hdl.handle.net/10784/967210.1016/j.cag.2004.11.009In surface reconstruction from planar slices it is necessary to build surfaces between corresponding 2D regions in consecutive levels -- The problem has been traditionally attacked with (i) direct reconstruction based on local geometric proximity between the regions, and (ii) classification of topological events between the slices, which control the evolution of the cross cuts -- These approaches have been separately applied with mixed success -- In the case (i), the results may be surfaces with over-stretched or unnatural branches, resulting from a local contour proximity which does not correspond to global similarity between regions -- In (ii), the consequences from topological events upon the actual surface realization have not been drawn -- In this paper an integration of (i) and (ii) is presented, which uses a criteria of similarity between composed 2D regions in consecutive slices to: (a) decide if a surface should actually relate those regions, (b) identify the topological transitions between levels and (c) construct the local surface for the related regions -- The method implemented hinders over-stretched and unnatural branches, therefore rendering a surface which adjusts to geometrically-sound topological events -- This is a good alternative when the surface reconstructed needs to be topologically faithful (for example in flow simulation) in addition to represent the a rough geometrical space (for example in radiation planning)application/pdfengElsevierComputers & Graphics, Volume 29, Issue 1, pp. 81-94http://dx.doi.org/10.1016/j.cag.2004.11.009Acceso cerradohttp://purl.org/coar/access_right/c_14cb2D Shape similarity as a complement for Voronoi-Delone methods in shape reconstructioninfo:eu-repo/semantics/articlearticleinfo:eu-repo/semantics/publishedVersionpublishedVersionArtículohttp://purl.org/coar/version/c_970fb48d4fbd8a85http://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1TOPOLOGÍAPROGRAMACIÓN HEURÍSTICAPROCESAMIENTO DE IMÁGENESPROCESAMIENTO DIGITAL DE IMÁGENESTopologyHeuristic programmingImage processingTopologyHeuristic programmingImage processingDiagramas de VoronoiGeometría computacionalReconstrucción 3DUniversidad EAFIT. Departamento de Ingeniería MecánicaRuíz S., Óscar E.Cadavid, Carlos A.Granados, MiguelPeña, SebastiánVásquez, ElianaLaboratorio CAD/CAM/CAEComputers & GraphicsComputers & Graphics2918194LICENSElicense.txtlicense.txttext/plain; charset=utf-82556https://repository.eafit.edu.co/bitstreams/923051fa-cbba-4186-9658-a7958c619647/download76025f86b095439b7ac65b367055d40cMD51ORIGINAL2D_shape_similarity_complement_voronoi_delone.pdf2D_shape_similarity_complement_voronoi_delone.pdfVersión incompletaapplication/pdf565684https://repository.eafit.edu.co/bitstreams/dd04e6fc-bb74-4a85-85a5-ac2099e4365c/downloadbae5b31d86a76c66109fbf48d02255fbMD5210784/9672oai:repository.eafit.edu.co:10784/96722021-09-03 15:43:42.97restrictedhttps://repository.eafit.edu.coRepositorio Institucional Universidad EAFITrepositorio@eafit.edu.co |
dc.title.eng.fl_str_mv |
2D Shape similarity as a complement for Voronoi-Delone methods in shape reconstruction |
title |
2D Shape similarity as a complement for Voronoi-Delone methods in shape reconstruction |
spellingShingle |
2D Shape similarity as a complement for Voronoi-Delone methods in shape reconstruction TOPOLOGÍA PROGRAMACIÓN HEURÍSTICA PROCESAMIENTO DE IMÁGENES PROCESAMIENTO DIGITAL DE IMÁGENES Topology Heuristic programming Image processing Topology Heuristic programming Image processing Diagramas de Voronoi Geometría computacional Reconstrucción 3D |
title_short |
2D Shape similarity as a complement for Voronoi-Delone methods in shape reconstruction |
title_full |
2D Shape similarity as a complement for Voronoi-Delone methods in shape reconstruction |
title_fullStr |
2D Shape similarity as a complement for Voronoi-Delone methods in shape reconstruction |
title_full_unstemmed |
2D Shape similarity as a complement for Voronoi-Delone methods in shape reconstruction |
title_sort |
2D Shape similarity as a complement for Voronoi-Delone methods in shape reconstruction |
dc.creator.fl_str_mv |
Ruíz S., Óscar E. Cadavid, Carlos A. Granados, Miguel Peña, Sebastián Vásquez, Eliana |
dc.contributor.department.spa.fl_str_mv |
Universidad EAFIT. Departamento de Ingeniería Mecánica |
dc.contributor.author.none.fl_str_mv |
Ruíz S., Óscar E. Cadavid, Carlos A. Granados, Miguel Peña, Sebastián Vásquez, Eliana |
dc.contributor.researchgroup.spa.fl_str_mv |
Laboratorio CAD/CAM/CAE |
dc.subject.lemb.spa.fl_str_mv |
TOPOLOGÍA PROGRAMACIÓN HEURÍSTICA PROCESAMIENTO DE IMÁGENES PROCESAMIENTO DIGITAL DE IMÁGENES |
topic |
TOPOLOGÍA PROGRAMACIÓN HEURÍSTICA PROCESAMIENTO DE IMÁGENES PROCESAMIENTO DIGITAL DE IMÁGENES Topology Heuristic programming Image processing Topology Heuristic programming Image processing Diagramas de Voronoi Geometría computacional Reconstrucción 3D |
dc.subject.keyword.spa.fl_str_mv |
Topology Heuristic programming Image processing |
dc.subject.keyword.eng.fl_str_mv |
Topology Heuristic programming Image processing |
dc.subject.keyword..keywor.fl_str_mv |
Diagramas de Voronoi Geometría computacional Reconstrucción 3D |
description |
In surface reconstruction from planar slices it is necessary to build surfaces between corresponding 2D regions in consecutive levels -- The problem has been traditionally attacked with (i) direct reconstruction based on local geometric proximity between the regions, and (ii) classification of topological events between the slices, which control the evolution of the cross cuts -- These approaches have been separately applied with mixed success -- In the case (i), the results may be surfaces with over-stretched or unnatural branches, resulting from a local contour proximity which does not correspond to global similarity between regions -- In (ii), the consequences from topological events upon the actual surface realization have not been drawn -- In this paper an integration of (i) and (ii) is presented, which uses a criteria of similarity between composed 2D regions in consecutive slices to: (a) decide if a surface should actually relate those regions, (b) identify the topological transitions between levels and (c) construct the local surface for the related regions -- The method implemented hinders over-stretched and unnatural branches, therefore rendering a surface which adjusts to geometrically-sound topological events -- This is a good alternative when the surface reconstructed needs to be topologically faithful (for example in flow simulation) in addition to represent the a rough geometrical space (for example in radiation planning) |
publishDate |
2005 |
dc.date.issued.none.fl_str_mv |
2005 |
dc.date.available.none.fl_str_mv |
2016-11-18T22:02:56Z |
dc.date.accessioned.none.fl_str_mv |
2016-11-18T22:02:56Z |
dc.type.eng.fl_str_mv |
info:eu-repo/semantics/article article info:eu-repo/semantics/publishedVersion publishedVersion |
dc.type.coarversion.fl_str_mv |
http://purl.org/coar/version/c_970fb48d4fbd8a85 |
dc.type.coar.fl_str_mv |
http://purl.org/coar/resource_type/c_6501 http://purl.org/coar/resource_type/c_2df8fbb1 |
dc.type.local.spa.fl_str_mv |
Artículo |
status_str |
publishedVersion |
dc.identifier.issn.none.fl_str_mv |
0097-8493 |
dc.identifier.uri.none.fl_str_mv |
http://hdl.handle.net/10784/9672 |
dc.identifier.doi.none.fl_str_mv |
10.1016/j.cag.2004.11.009 |
identifier_str_mv |
0097-8493 10.1016/j.cag.2004.11.009 |
url |
http://hdl.handle.net/10784/9672 |
dc.language.iso.eng.fl_str_mv |
eng |
language |
eng |
dc.relation.ispartof.spa.fl_str_mv |
Computers & Graphics, Volume 29, Issue 1, pp. 81-94 |
dc.relation.uri.none.fl_str_mv |
http://dx.doi.org/10.1016/j.cag.2004.11.009 |
dc.rights.coar.fl_str_mv |
http://purl.org/coar/access_right/c_14cb |
dc.rights.local.spa.fl_str_mv |
Acceso cerrado |
rights_invalid_str_mv |
Acceso cerrado http://purl.org/coar/access_right/c_14cb |
dc.format.eng.fl_str_mv |
application/pdf |
dc.publisher.spa.fl_str_mv |
Elsevier |
institution |
Universidad EAFIT |
bitstream.url.fl_str_mv |
https://repository.eafit.edu.co/bitstreams/923051fa-cbba-4186-9658-a7958c619647/download https://repository.eafit.edu.co/bitstreams/dd04e6fc-bb74-4a85-85a5-ac2099e4365c/download |
bitstream.checksum.fl_str_mv |
76025f86b095439b7ac65b367055d40c bae5b31d86a76c66109fbf48d02255fb |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 |
repository.name.fl_str_mv |
Repositorio Institucional Universidad EAFIT |
repository.mail.fl_str_mv |
repositorio@eafit.edu.co |
_version_ |
1814110214458179584 |