The first is based on subdividing the space in a finite number of regions, each with a certain level of detail.
The second considers the polygon mesh being rendered as a function which must be evaluated requiring to avoid excessive errors which are a function of some heuristic (usually distance) themselves.