Using Grover's search quantum algorithm to solve Boolean satisfiability problems, part 2

By Diogo Fernandes, Carla Silva, Inês Dutra, November 2019

PDF | HTML | In the Digital Library

Using Grover's search quantum algorithm to solve Boolean satisfiability problems: Part I

By Diogo Fernandes, Inês Dutra, September 2019

PDF | HTML | In the Digital Library

DEPARTMENT: Blogs

Algorithms Fit for Compilation?

Should there be a standard in the way of algorithms languages to improve productivity and remove ambiguity?

By Olivia Simpson, September 2013

PDF | HTML | In the Digital Library

Levels of detail & polygonal simplification

This paper covers the techniques of Polygonal Simplification in order to produce Levels of Detail (LODs). The problem of creating LODs is a complex one: how can simpler versions of a model be created? How can the approximation error be measured? How can the visual degradation be estimated? Can all this be done automatically? After exposing the basic aims and principles of polygonal simplification, we compare recent algorithms and state their various qualities and weaknesses.

By Mike Krus, Patrick Bourdot, Françoise Guisnel, Gullaume Thibault, May 1997

PDF | HTML | In the Digital Library