Frank Nielsen's banner

Frank Nielsen

@FrnkNlsn • 41,158 subscribers

Information Geometry, Information Theory, Geometric Science of Information GSI, machine learning, AI, visual computing, HPC, pyBregMan @SonyCSL

Videos

Anya Rossi

sweetdream.ai

SweetDream.ai•Sponsored•Livecam

Watch Anya Live

Anya is streaming live right now! Join her private show and enjoy exclusive content.

Exclusive private shows

1.2k viewers online

Private Show

Join now for exclusive access

Free preview available • Premium content

$Voronoi diagram (black points) computed by projecting vertically lower envelope of n 3D graphs of functions {(x,y_i(x))} with y_i(x)=D(x_i,x) (pink). When distance D(x,x')=‖x-x'‖^2, graphs of y_i are paraboloids and Voronoi cell borders are linear$

Voronoi diagram (black points) computed by projecting vertically lower envelope of n 3D graphs of functions {(x,y_i(x))} with y_i(x)=D(x_i,x) (pink). When distance D(x,x')=‖x-x'‖^2, graphs of y_i are paraboloids and Voronoi cell borders are linear

98,307 次观看 • 7 个月前

Euclidean Voronoi diagrams are affine diagrams: bisectors are hyperplanes (red 1d lines). Compute Voronoi diagrams as minimization diagrams of paraboloids: square distance functions from sites. Extend to Bregman Voronoi diagrams by using convex potential functions. Duality.

Euclidean Voronoi diagrams are affine diagrams: bisectors are hyperplanes (red 1d lines). Compute Voronoi diagrams as minimization diagrams of paraboloids: square distance functions from sites. Extend to Bregman Voronoi diagrams by using convex potential functions. Duality.

32,117 次观看 • 1 年前

没有更多内容可加载