Physics. 2018-06, 8. doi:10.1007/s13324-018-0226-8. Ruppert, J.; Seidel, R(英语:RaimundSeidel), On the difficulty of triangulating three-dimensional nonconvex
MR 1782654 . See in particular Theorem 3, p. 176 (页面存档备份,存于互联网档案馆). Seidel, Raimund, Constructing higher-dimensional convex hulls at logarithmic cost per
线性迭代对数时间 O ( n log ∗ n ) {\displaystyle O(n\log ^{*}n)} 萊姆德·賽德爾(英语:RaimundSeidel)的三角分割多边形(英语:Polygon triangulation)算法 线性对数时间 O ( n log n ) {\displaystyle