Digital Library

cab1

 
Title:      REPRESENTING EXTRATED EDGES FROM IMAGES BY USING CONSTRAINED DELAUNAY TRIANGULATION
Author(s):      Simena Dinas, José María Bañón Pinar
ISBN:      978-989-8533-14-2
Editors:      Hans Weghorn and Pedro Isaías
Year:      2012
Edition:      Single
Keywords:      Delaunay Triangulation, Constrained Delaunay Triangulation, Delaunay Constrained Triangulation, Edge Extraction, Corner Extraction.
Type:      Poster/Demonstration
First Page:      439
Last Page:      442
Language:      English
Cover:      cover          
Full Contents:      click to dowload Download
Paper Abstract:      Delaunay Triangulation has been used in computational geometry and mathematics; it is a net formed by the union of non-overlapping triangles, where there are no points inside the circumcircle of each triangle. It is popular for meshing algorithms; however, in real world some important edges can be ignored to preserve the “Delaunayhood” of the structure. Constrained Delaunay Triangulation is an extension of Delaunay which forces required edges in the Triangulation; moreover, the resulting triangulation is not always a Delaunay Triangulation. Due to the continuously increasing images volume; there are some researches on extracting information from images. An application combining extracted data from images and Constrained Delaunay Triangulation is shown.
   

Social Media Links

Search

Login