Incremental Labelling of Voronoi Vertices for Shape Reconstruction
| dc.contributor.author | Peethambaran, J. | en_US |
| dc.contributor.author | Parakkat, A.D. | en_US |
| dc.contributor.author | Tagliasacchi, A. | en_US |
| dc.contributor.author | Wang, R. | en_US |
| dc.contributor.author | Muthuganapathy, R. | en_US |
| dc.contributor.editor | Chen, Min and Benes, Bedrich | en_US |
| dc.date.accessioned | 2019-03-17T09:57:02Z | |
| dc.date.available | 2019-03-17T09:57:02Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | We present an incremental Voronoi vertex labelling algorithm for approximating contours, medial axes and dominant points (high curvature points) from 2D point sets. Though there exist many number of algorithms for reconstructing curves, medial axes or dominant points, a unified framework capable of approximating all the three in one place from points is missing in the literature. Our algorithm estimates the normals at each sample point through poles (farthest Voronoi vertices of a sample point) and uses the estimated normals and the corresponding tangents to determine the spatial locations (inner or outer) of the Voronoi vertices with respect to the original curve. The vertex classification helps to construct a piece‐wise linear approximation to the object boundary. We provide a theoretical analysis of the algorithm for points non‐uniformly (ε‐sampling) sampled from simple, closed, concave and smooth curves. The proposed framework has been thoroughly evaluated for its usefulness using various test data. Results indicate that even sparsely and non‐uniformly sampled curves with outliers or collection of curves are faithfully reconstructed by the proposed algorithm.We present an incremental Voronoi vertex labelling algorithm for approximating contours, medial axes and dominant points (high curvature points) from 2D point sets. Though there exist many number of algorithms for reconstructing curves, medial axes or dominant points, a unified framework capable of approximating all the three in one place from points is missing in the literature. Our algorithm estimates the normals at each sample point through poles (farthest Voronoi vertices of a sample point) and uses the estimated normals and the corresponding tangents to determine the spatial locations (inner or outer) of the Voronoi vertices with respect to the original curve. The vertex classification helps to construct a piece‐wise linear approximation to the object boundary. We provide a theoretical analysis of the algorithm for points non‐uniformly (ε‐sampling) sampled from simple, closed, concave and smooth curves. | en_US |
| dc.description.number | 1 | |
| dc.description.sectionheaders | Articles | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 38 | |
| dc.identifier.doi | 10.1111/cgf.13589 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 521-536 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.13589 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf13589 | |
| dc.publisher | © 2019 The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | curves and surfaces | |
| dc.subject | modelling | |
| dc.subject | computational geometry | |
| dc.subject | geometric modelling | |
| dc.subject | •Computing methodologies → Computer graphics; Shape analysis; •Theory of computation → Computational geometry | |
| dc.title | Incremental Labelling of Voronoi Vertices for Shape Reconstruction | en_US |