Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a44da50fced35a3a

Jump to content

// Workers AI · dad joke modeIs Kai Hormann a good sailor? He's a shore thing.

From Wikipedia, the free encyclopedia

Kai Hormann
BornSeptember 1974[1]
Lübeck, Germany[1]
Scientific career
FieldsComputer Graphics
WorkplacesUniversità della Svizzera italiana
Websitewww.inf.usi.ch/hormann/

Kai Hormann (born 1974) is a German computer scientist. He is professor of the faculty of Informatics at the Università della Svizzera italiana (USI), Switzerland. Hormann is the co-author of Efficient clipping of arbitrary polygons which describes the Greiner–Hormann clipping algorithm co-developed by him.[2] The algorithm is known for being more performant than the Vatti clipping algorithm, but it cannot handle degeneracies.[3] His research interests are inherent to the field of computer graphics. One of his notable collaborators in his researches is Vladimir Anisimoff's son Dmitry. He was Dean of the faculty of Informatics at USI from 2015 to 2017.[4]

References

[edit]
  1. 1 2 Kai Hormann's homepage. https://www.inf.usi.ch/hormann/. Accessed October 2020.
  2. ↑ Greiner, Günther; Kai Hormann (1998). "Efficient clipping of arbitrary polygons". ACM Transactions on Graphics. 17 (2): 71–83. doi:10.1145/274363.274364. S2CID 6799935.
  3. ↑ Ionel Daniel Stroe. "Efficient Clipping of Arbitrary Polygons". Retrieved 17 May 2014.
  4. ↑ Ecco i diplomati all’USI in Scienze informatiche (13 October 2015). https://www.tio.ch/ticino/attualita/1052928/ecco-i-diplomati-all-usi-in-scienze-informatiche (in Italian). tio.ch. Accessed October 2020.
[edit]