Structural tolerance and delauny triangulation
作者： Manuel Abellanas , Ferran Hurtado , Pedro A. Ramos
DOI: 10.1016/S0020-0190(99)00107-6
关键词: Polygon triangulation 、 Time complexity 、 Point set triangulation 、 Mathematics 、 Constrained Delaunay triangulation 、 Combinatorics 、 Bowyer–Watson algorithm 、 Minimum-weight triangulation 、 Pitteway triangulation 、 Delaunay triangulation
摘要: … the tolerance of a geometric or combinatorial structure associated to … structure essentially unchanged. We concentrate on studying the Delaunay triangulation and show that its tolerance …
elsevier.com
sci-hub.se 参考文章(26)
William Evans, Regular polygons are most tolerant. canadian conference on computational geometry. pp. 109- 113 ,(1995)
Chee Yap, Low Level Issues in Computational Geometry. canadian conference on computational geometry. pp. 405- 419 ,(1993)
Sergey P. Tarasov, On hardness of roundness calculation. canadian conference on computational geometry. ,(1997)
T. J. Rivlin, Approximation by circles Computing. ,vol. 21, pp. 93- 104 ,(1979) , 10.1007/BF02253130
Thomas Roos, Tighter Bounds on Voronoi Diagrams of Moving Points. canadian conference on computational geometry. pp. 358- 363 ,(1993)
Manuel Abellanas, Ferran Hurtado, Pedro A. Ramos, Tolerance of Geometric Structures. canadian conference on computational geometry. pp. 250- 255 ,(1994)
Frank Weller, Stability of voronoi neighborship under perturbations of the sites. canadian conference on computational geometry. ,(1997)
Kelly A. Lyons, Cluster busting in anchored graph drawing conference of the centre for advanced studies on collaborative research. pp. 327- 337 ,(1992)
Henk Meijer, David Rappaport, Kelly A. Lyons, Properties of the voronoi diagram cluster buster conference of the centre for advanced studies on collaborative research. pp. 1148- 1163 ,(1993)
Ramos Alonso, A Pedro, Tolerancia de Estructuras Geométricas y Combinatorias Facultad de Informática (UPM). ,(2012)