C G / 0 20 90 07 v 1 4 S ep 2 00 2 A Survey and a New Competitive Method for the Planar Min-# Problem

We develop a new technique for planar polygonal chain simplification based on a digital geometry object: the digital line. We first survey most of the different types of approximation algorithms which minimize the number of output vertices. We present their main qualities and their inherent drawbacks. Then we introduce our approximation method and improve… CONTINUE READING