A Slow Algorithm for Computing the Gabriel Graph with Double Precision
David L. Millman, Vishal Verma · 2011
When designing algorithms, time and space usage are commonly considered. In 1999, Liotta, Preparata and Tamassia proposed that we could also analyze the precision of an algorithm. We present our first steps towards the goal of efficiently computing the Gabriel graph of a finite set of sites, while restricting ourselves to only double precision. 1